{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"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":"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":"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"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":"readers._read_csv_chunks (cyclomatic 70): readers._read_csv_chunks 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":"pandas/io/parsers/readers.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"52859ff4845358955cda474d7b61d63079bf74dc627b970f9de55a45e762e1d0"}},{"ruleId":"D1","level":"warning","message":{"text":"cast.np_can_hold_element (cyclomatic 68): cast.np_can_hold_element 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21b9d95764c4c3db57440f251c7b38a334f22f06e6cb93c433b8b6158f19377"}},{"ruleId":"D1","level":"warning","message":{"text":"_MergeOperation._maybe_coerce_merge_keys (cyclomatic 65): _MergeOperation._maybe_coerce_merge_keys has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c099ce90001cfec29757a154e1384f44b131f355ba5bff29558663893e6375"}},{"ruleId":"D1","level":"warning","message":{"text":"cast.convert_dtypes (cyclomatic 55): cast.convert_dtypes has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"14073e59df0589274ac517b6a9c43f5b9ac861efb7659cf40035ff66fd8729d4"}},{"ruleId":"D1","level":"warning","message":{"text":"numeric.to_numeric (cyclomatic 51): numeric.to_numeric has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/tools/numeric.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"698e83dc644e14a34b65c3c2ff8a08c3545d893b6362352b55ad842af5329d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"Table._create_axes (cyclomatic 51): Table._create_axes has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":4821}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2d9cfb20bf3ed4aa8dbafaa4b0ff1a8197800c505ba8a27159d263ae65dc08"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiIndex._get_locs (cyclomatic 50): MultiIndex._get_locs has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":4223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc19fd3f73dfec960330ba533e9b0c23c92a11a14d8d6af92373d9e0c488f0d"}},{"ruleId":"D1","level":"warning","message":{"text":"asserters.assert_series_equal (cyclomatic 47): asserters.assert_series_equal 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":"pandas/_testing/asserters.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d72c639fe3d9f777b428244ef3123093d7c4c70330e1e3d90d914cc974fbc2f"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame._where (cyclomatic 46): NDFrame._where 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":"pandas/core/generic.py"},"region":{"startLine":10411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b471f70cfc3ceaeb4a88db6fadb00bc9c749ae33492ce8910f059b600d74bed3"}},{"ruleId":"D1","level":"warning","message":{"text":"common.get_handle (cyclomatic 46): common.get_handle 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":"pandas/io/common.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bb44512b1e59f1fe2dff9cec583f063e97979600164f1fc1586017063ea923"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray._evaluate_op_method (cyclomatic 45): ArrowExtensionArray._evaluate_op_method has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c88e925b03df115e163576a8423b5974570bb6465323a00e75c38ed4ccf3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Series.__init__ (cyclomatic 45): Series.__init__ has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd0fddbc3c773d8425abc58d64ff7ed23fb9f9d422f7a1ec7513cf5f77fc1d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Index.join (cyclomatic 44): Index.join 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":"pandas/core/indexes/base.py"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e11980f89a1a6a0fff2455d046e6504fdbbfd3bb24b14d52463ff27e1e9f739"}},{"ruleId":"D1","level":"warning","message":{"text":"DatetimeArray._generate_range (cyclomatic 43): DatetimeArray._generate_range 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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bda02ab81bb46e84de4bcc3fdc697762e03700fdb6dfa47b1c52b8f3c5b4fd"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiIndex._get_loc_level (cyclomatic 43): MultiIndex._get_loc_level 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":"pandas/core/indexes/multi.py"},"region":{"startLine":3860}}}],"partialFingerprints":{"codehealthFindingId/v1":"064a04dfe0be3a643a7013433fbb58a31d5fa9d4a7eddf011e27d5cfa3dbf314"}},{"ruleId":"D1","level":"warning","message":{"text":"readers._can_parallelize_csv (cyclomatic 43): readers._can_parallelize_csv has cyclomatic complexity 43 (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":"pandas/io/parsers/readers.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67abb2e6603606d5abe74ca2a8c93f48c85c2d436b8b9d488e5e5650fb5c141"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonParser._infer_columns (cyclomatic 42): PythonParser._infer_columns 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c43260679e3187f82404b1999b0b7b36075f097cc7463af603e41b38b9bd4b"}},{"ruleId":"D1","level":"warning","message":{"text":"TextFileReader._clean_options (cyclomatic 42): TextFileReader._clean_options 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":"pandas/io/parsers/readers.py"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0657848aad06315ade5196ea048a53482f301a038149ac57647e6158e01e0e4"}},{"ruleId":"D1","level":"warning","message":{"text":"construction.array (cyclomatic 41): construction.array has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/construction.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9254e71cfeeb80921f2a7c5d6708c4876160fff457f277b8021f5bb94846d77"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray._box_pa_array (cyclomatic 40): ArrowExtensionArray._box_pa_array 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"51425c504594fdff55149fd764085ce746eed27c2580d0b6bc669a4d7ab17495"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray._reduce_pyarrow (cyclomatic 40): ArrowExtensionArray._reduce_pyarrow has cyclomatic complexity 40 (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"530426b4df9d04bcee165eacf789b91edc619d03f9360de068070a94447506bc"}},{"ruleId":"D1","level":"warning","message":{"text":"grouper.get_grouper (cyclomatic 40): grouper.get_grouper 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":"pandas/core/groupby/grouper.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"331684e63a46edc08349a3cf4c7033e1024fd406ddddf10f1ebc49dafe330378"}},{"ruleId":"D1","level":"warning","message":{"text":"construction.ndarray_to_mgr (cyclomatic 40): construction.ndarray_to_mgr 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":"pandas/core/internals/construction.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0941575b5935fc67483ee437295c17ee4776956de68a220e178462e2f2fa956"}},{"ruleId":"D1","level":"warning","message":{"text":"_MergeOperation._maybe_add_join_keys (cyclomatic 40): _MergeOperation._maybe_add_join_keys 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ea96adb4cd09b954bab693d22aa0c24f73e76aed856fd69e0ecebcfd74b8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"StataReader.read (cyclomatic 40): StataReader.read 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":"pandas/io/stata.py"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ed66f3920fb459a94a19c8c1f9ac02fac700582252434a586e165976f6d55"}},{"ruleId":"D1","level":"warning","message":{"text":"eval.eval (cyclomatic 39): eval.eval 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":"pandas/core/computation/eval.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ec11caf562494a041c9c16c4bdd66156f8e5b847a8541da18ee384e7642a53"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.__init__ (cyclomatic 39): DataFrame.__init__ 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":"pandas/core/frame.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ba3178c1006ddc131f3d09a8b4f12b3630e7583120fa102a6ec7d19675c612"}},{"ruleId":"D1","level":"warning","message":{"text":"algorithms.isin (cyclomatic 38): algorithms.isin 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":"pandas/core/algorithms.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b358bb787e41a55d031692a2222ad70999ff49e4060ddd49cda679b235391e"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame.replace (cyclomatic 38): NDFrame.replace 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":"pandas/core/generic.py"},"region":{"startLine":7733}}}],"partialFingerprints":{"codehealthFindingId/v1":"21748a3227a762228a71210248d151eb453cf072ef711cb69fc84ddba025fd94"}},{"ruleId":"D1","level":"warning","message":{"text":"StringMethods._wrap_result (cyclomatic 38): StringMethods._wrap_result 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":"pandas/core/strings/accessor.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7343e9f1eed89db4df3cff85bf2603c0a664fa7a6f50401afdaa8262bba3dba"}},{"ruleId":"D1","level":"warning","message":{"text":"_XMLFrameParser._iterparse_nodes (cyclomatic 38): _XMLFrameParser._iterparse_nodes 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":"pandas/io/xml.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"373ca9477a0f47fe1db64a97763b0e1b46cc6869206f9dc1cd098ad698ac8153"}},{"ruleId":"D1","level":"warning","message":{"text":"numeric._coerce_to_data_and_mask (cyclomatic 37): numeric._coerce_to_data_and_mask 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":"pandas/core/arrays/numeric.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26b28dcec646c9391730867b973bda96571b19c89ce27b98b48865ebc3eff43"}},{"ruleId":"D1","level":"warning","message":{"text":"pivot.__internal_pivot_table (cyclomatic 37): pivot.__internal_pivot_table 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":"pandas/core/reshape/pivot.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"0528a8a567b603e734b9a0994d6486b86149791c8fb57ef32f0451540b7f0dee"}},{"ruleId":"D1","level":"warning","message":{"text":"stata._cast_to_stata_types (cyclomatic 37): stata._cast_to_stata_types 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":"pandas/io/stata.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bcf8fefcc5506ecb16fa3c5e6b48d7cb6d8aae7605b7ac3548ec83c503c241"}},{"ruleId":"D1","level":"warning","message":{"text":"cast._maybe_promote (cyclomatic 36): cast._maybe_promote 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5507038e0dcf2a7ac1fe1f62629f73bf2761680c8893f4da686b507a035ba506"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowParserWrapper._get_pyarrow_options (cyclomatic 36): ArrowParserWrapper._get_pyarrow_options 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":"pandas/io/parsers/arrow_parser_wrapper.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87069509ca5ec05c3decfd11f6d053462be8388d2ba4c893116be18b8103dda"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray._cast_pointwise_result (cyclomatic 35): ArrowExtensionArray._cast_pointwise_result has cyclomatic complexity 35 (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea24be92639f1c78e148be7425962d8b29181554978b3f1ca90a5dca8924610"}},{"ruleId":"D1","level":"warning","message":{"text":"construction.sanitize_array (cyclomatic 35): construction.sanitize_array has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/construction.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"39079692f8acfb8d428c43b33750965a57efd884424613d155593a75e8443762"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame._reduce (cyclomatic 35): DataFrame._reduce has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":17063}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fc84a4f55523d8e4f6dd61229b4a0578385cc18addbf5aa6ae306bad67fb61"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame.fillna (cyclomatic 35): NDFrame.fillna has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":7277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8068355493d48c330390fb621cb157c5cabc53e26fc8c56a9aba4e9bed72ffe1"}},{"ruleId":"D1","level":"warning","message":{"text":"WrappedCythonOp._call_cython_op (cyclomatic 35): WrappedCythonOp._call_cython_op has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/ops.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"72813d642a35bebdd2ff54589530202dcded0895ac50b89a106d9ac355fa3ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"PlotAccessor.__call__ (cyclomatic 35): PlotAccessor.__call__ has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_core.py"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"898257555fbd1de0616c369676dd3580f171d5f11aa1a291d97252159b220efd"}},{"ruleId":"D1","level":"warning","message":{"text":"datetimes._assemble_from_unit_mappings (cyclomatic 34): datetimes._assemble_from_unit_mappings 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":"pandas/core/tools/datetimes.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8f6a9a544b9fb55fbd0569d4a9bd14a221505b37ab4e6e6ce144d02102a2bd"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame.to_latex (cyclomatic 33): NDFrame.to_latex has cyclomatic complexity 33 (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":"pandas/core/generic.py"},"region":{"startLine":3455}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3253db17fc5c7700e5f53721be21332272c4158042734a3a9f832356284d7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Index.__new__ (cyclomatic 33): Index.__new__ 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":"pandas/core/indexes/base.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfb93908229507146cd903e8dfa0f94be85c40ce3e767419124f4584d8794a1"}},{"ruleId":"D1","level":"warning","message":{"text":"_json.to_json (cyclomatic 33): _json.to_json 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":"pandas/io/json/_json.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9733ca6d471f0b462c8859b14e64c10425a1278c754b0a0eb30fbff1081443"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.from_records (cyclomatic 32): DataFrame.from_records 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":"pandas/core/frame.py"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ce101fcf8a6f8c4eb4b2c8a0d60f75c8a548f6559d73e76c12571db5aab867"}},{"ruleId":"D1","level":"warning","message":{"text":"merge._factorize_keys (cyclomatic 32): merge._factorize_keys 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":"pandas/core/reshape/merge.py"},"region":{"startLine":2873}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a7dd2f16172523c8f51025f3115b21acf2467ae1598ec883bde24f458836ce"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._daily_finder (cyclomatic 32): converter._daily_finder has cyclomatic complexity 32 (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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13c55df53c11e308b02555738d78ee1e6832fc560c5da0dd28bf9690607328d"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame._reduce_axis1 (cyclomatic 31): DataFrame._reduce_axis1 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":"pandas/core/frame.py"},"region":{"startLine":17244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2412fa0c75a501d95679384a0882914ad8fef2cc2136d043258f98984dcac411"}},{"ruleId":"D1","level":"warning","message":{"text":"common._get_filepath_or_buffer (cyclomatic 31): common._get_filepath_or_buffer 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":"pandas/io/common.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3627d593428b03e5df8692316eb673e6b5ba540706bdf6bfe9202458dc14927"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseExcelReader._parse_sheet (cyclomatic 31): BaseExcelReader._parse_sheet 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":"pandas/io/excel/_base.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"56032cc40d285adb0d8b281b6c5dd1c6906adecff7ae0b32fb1b7b3cda6e913e"}},{"ruleId":"D1","level":"warning","message":{"text":"asserters.assert_index_equal (cyclomatic 30): asserters.assert_index_equal 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":"pandas/_testing/asserters.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c323cdcccc1d75157c048f966793e704f42c5fcfeaae290bfd9db10b11330dfa"}},{"ruleId":"D1","level":"warning","message":{"text":"SparseArray.__init__ (cyclomatic 30): SparseArray.__init__ 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"2376967d7b6614a76788314799847568d2576df680b9500e1539378fbdbb2956"}},{"ruleId":"D1","level":"warning","message":{"text":"astype.astype_is_view (cyclomatic 30): astype.astype_is_view has cyclomatic complexity 30 (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":"pandas/core/dtypes/astype.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"212fbc2a3d4d3c33543d9fb2ca4602b98c5e7f9671f61e9e670225cd38812b31"}},{"ruleId":"D1","level":"warning","message":{"text":"interval.interval_range (cyclomatic 30): interval.interval_range 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":"pandas/core/indexes/interval.py"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac54346c1205ca11451c75ada5d3e9bcfab2e1249d5201fa4b7f1e7b257b863a"}},{"ruleId":"D1","level":"warning","message":{"text":"_MergeOperation._validate_left_right_on (cyclomatic 30): _MergeOperation._validate_left_right_on 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfddce5b12ccf7705b2f9d58c8304d1a1bd8d178badc6902d9c9e171375bf7ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserBase._infer_types (cyclomatic 30): ParserBase._infer_types 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":"pandas/io/parsers/base_parser.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8de11062be70416aa8cc4705ef584ac886049e1de9b5eefa896035a0e426d7"}},{"ruleId":"D1","level":"warning","message":{"text":"DatetimeLikeArrayMixin._validate_listlike (cyclomatic 29): DatetimeLikeArrayMixin._validate_listlike 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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a7310c988605b7154d6f7635600ad5bd8432da1b41bd282adb615f8411bc47"}},{"ruleId":"D1","level":"warning","message":{"text":"_iLocIndexer._align_series (cyclomatic 29): _iLocIndexer._align_series 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":"pandas/core/indexing.py"},"region":{"startLine":3236}}}],"partialFingerprints":{"codehealthFindingId/v1":"418771683b6e223b2437197b9daf325ed44feb168952adb344caa54d6670ca29"}},{"ruleId":"D1","level":"warning","message":{"text":"merge.get_join_indexers (cyclomatic 29): merge.get_join_indexers 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":"pandas/core/reshape/merge.py"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f927672460007d95a1a2f82908571c30639475c83ca5c10090ce85ceebb235e"}},{"ruleId":"D1","level":"warning","message":{"text":"datetimes._convert_listlike_datetimes (cyclomatic 29): datetimes._convert_listlike_datetimes 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":"pandas/core/tools/datetimes.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"881d0921903696160ea41344d325229694c586702511f4cf1fbe9be955be695a"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._try_convert_data (cyclomatic 29): Parser._try_convert_data 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":"pandas/io/json/_json.py"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6b8dfb55f5e490d25f7ebf4f4ee995dec1fbfabc54c4d1004a97da4a9415b9"}},{"ruleId":"D1","level":"warning","message":{"text":"arraylike.array_ufunc (cyclomatic 28): arraylike.array_ufunc 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":"pandas/core/arraylike.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c48f00f5c1d3f9da4fdc19aeeaa4709e1741ce02a3e7155d94b59d8c7a673e"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseMaskedArray._arith_method (cyclomatic 28): BaseMaskedArray._arith_method 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":"pandas/core/arrays/masked.py"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7aefca90d578f64b311eed6a12e4cb56df49890f4797f9f26166bb62a768f2f"}},{"ruleId":"D1","level":"warning","message":{"text":"to_dict.to_dict (cyclomatic 28): to_dict.to_dict 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":"pandas/core/methods/to_dict.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e56e424e494a8b5357e52421c9180450347d8ac68f7ee2fb6767d5b56e98e7"}},{"ruleId":"D1","level":"warning","message":{"text":"concat._make_concat_multiindex (cyclomatic 28): concat._make_concat_multiindex 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":"pandas/core/reshape/concat.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cea3b6385200910c4795156e388c3d65a6e74ce4fddc9f202e235afd7e76fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"melt.melt (cyclomatic 28): melt.melt 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":"pandas/core/reshape/melt.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd624ac140fb268571e16c498c37eb2c029b81e96b7c5c426239dbcd2ee53b3"}},{"ruleId":"D1","level":"warning","message":{"text":"_AsOfMerge._validate_left_right_on (cyclomatic 28): _AsOfMerge._validate_left_right_on 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":"pandas/core/reshape/merge.py"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccefb9cbb5436d457ca67817f47fcaeef1e4b7eeaba1cb59ecc86683fab85317"}},{"ruleId":"D1","level":"warning","message":{"text":"algorithms.safe_sort (cyclomatic 27): algorithms.safe_sort 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":"pandas/core/algorithms.py"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9da023575dc6c3d6f4c434d4db8625df881ecee7c8bfb06a5b73a3bc107e36"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray._groupby_op_pyarrow (cyclomatic 27): ArrowExtensionArray._groupby_op_pyarrow has cyclomatic complexity 27 (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":3900}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14d6d5c9d6b95576c1de2ae5748b87ab458d4cb3be0ca10a7a373d4463d1f24"}},{"ruleId":"D1","level":"warning","message":{"text":"IntervalArray._ensure_simple_new_inputs (cyclomatic 27): IntervalArray._ensure_simple_new_inputs has cyclomatic complexity 27 (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":"pandas/core/arrays/interval.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6398883969990fbb9782996803d54483b6a53352a979fef963faab53a4102b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"_iLocIndexer._setitem_with_indexer_split_path (cyclomatic 27): _iLocIndexer._setitem_with_indexer_split_path has cyclomatic complexity 27 (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":"pandas/core/indexing.py"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca9e787e861ec05e2ee5aad42df217a82c87e93139a594de7d3982e9cc26ca4"}},{"ruleId":"D1","level":"warning","message":{"text":"_util._post_convert_dtypes (cyclomatic 27): _util._post_convert_dtypes 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":"pandas/io/_util.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1c319005a398a8afe900e32091421bca791c235c2fd4c2e8a63ec787080b73"}},{"ruleId":"D1","level":"warning","message":{"text":"_normalize.json_normalize (cyclomatic 27): _normalize.json_normalize 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":"pandas/io/json/_normalize.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db1c8e31691b57b11b14b51e6cc3f7a0e4cdc5e821aace571c1c1fa186e81f6"}},{"ruleId":"D1","level":"warning","message":{"text":"min_max_.sliding_min_max (cyclomatic 26): min_max_.sliding_min_max 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":"pandas/core/_numba/kernels/min_max_.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87811c879990963611562017569d20e316140392acf0c5051f13bdd28fdf632"}},{"ruleId":"D1","level":"warning","message":{"text":"boolean.coerce_to_array (cyclomatic 26): boolean.coerce_to_array 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":"pandas/core/arrays/boolean.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8add3f7f4e89fba6ee9b853a6ceb4f01842f1c3eda1f0f8770e7e59c6ac5e66c"}},{"ruleId":"D1","level":"warning","message":{"text":"Categorical.__init__ (cyclomatic 26): Categorical.__init__ 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":"pandas/core/arrays/categorical.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"253f47b701934881da605e9e2ec2f1aa5c093e2d1708f52f2b4ef1260d7a43b6"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame.clip (cyclomatic 26): NDFrame.clip 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":"pandas/core/generic.py"},"region":{"startLine":8998}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d879835c9d456091d067ac62c5f4c95789eb2ddbbf4ca3587134491f3a5933c"}},{"ruleId":"D1","level":"warning","message":{"text":"DatetimeIndexOpsMixin.equals (cyclomatic 26): DatetimeIndexOpsMixin.equals 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":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae68cf09b61f9e5cfba0408f63f1abde5624395c5d5501d3b3f4e10792c774f"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeGrouper.__init__ (cyclomatic 26): TimeGrouper.__init__ 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":"pandas/core/resample.py"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"05873dd9eef847a4235732f16a7be657a6b0395ff99d85b437f6e931f809d58d"}},{"ruleId":"D1","level":"warning","message":{"text":"concat.concat (cyclomatic 26): concat.concat 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":"pandas/core/reshape/concat.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ec4238caf098b884ed88fba7f2d337caaf511498706ab63b152312956da1ad"}},{"ruleId":"D1","level":"warning","message":{"text":"_table_schema.parse_table_schema (cyclomatic 26): _table_schema.parse_table_schema 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":"pandas/io/json/_table_schema.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"273e2e40d6b264bad9e6be97732aac03d57d6559f8ab04ca3f48259660135e80"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray._from_sequence_of_strings (cyclomatic 25): ArrowExtensionArray._from_sequence_of_strings 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"075f493dd6a5b921b09d0b064626b759814f38f2f211fd50414c5eb5ef70e507"}},{"ruleId":"D1","level":"warning","message":{"text":"timedeltas.sequence_to_td64ns (cyclomatic 25): timedeltas.sequence_to_td64ns 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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df7cd8de3b80a94e8046efa49566cb4e034838cbebe837c89bcf50f58b293cd"}},{"ruleId":"D1","level":"warning","message":{"text":"cast.maybe_downcast_numeric (cyclomatic 25): cast.maybe_downcast_numeric 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0743e45d01b8d93dccbbec31193e48fc935fc089862f1e6c56cf269fe43209c0"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame._align_for_op (cyclomatic 25): DataFrame._align_for_op 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":"pandas/core/frame.py"},"region":{"startLine":10396}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac62ddb4097d9018e66011c7a13c59e21907ea19edde448fc9cf23cab89a769"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseGrouper._reduceat_aggregate (cyclomatic 25): BaseGrouper._reduceat_aggregate has cyclomatic complexity 25 (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":"pandas/core/groupby/ops.py"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"a811b7813a31ee8e42a6adb8113a82bbc563f066ab598fe840bc5e2d3fb7063c"}},{"ruleId":"D1","level":"warning","message":{"text":"api.union_indexes (cyclomatic 25): api.union_indexes 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":"pandas/core/indexes/api.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e940838bb288a3f8834740ef2029d03c53b06a8021c3303d4038a380d5663719"}},{"ruleId":"D1","level":"warning","message":{"text":"RangeIndex._difference (cyclomatic 25): RangeIndex._difference has cyclomatic complexity 25 (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":"pandas/core/indexes/range.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f3143574250cf335c676e01a030fbe719b6e2ba14820d6d507ad35fbcaaa9c"}},{"ruleId":"D1","level":"warning","message":{"text":"encoding._get_dummies_1d (cyclomatic 25): encoding._get_dummies_1d has cyclomatic complexity 25 (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":"pandas/core/reshape/encoding.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8affdebf83639258c010fae47a1144d28b09baaac378cebb9946d86093cee521"}},{"ruleId":"D1","level":"warning","message":{"text":"datetimes.to_datetime (cyclomatic 25): datetimes.to_datetime 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":"pandas/core/tools/datetimes.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"923c6939492753cb0e4cf246bc3521652ecdff12bc7ea213089f742eb02ec992"}},{"ruleId":"D1","level":"warning","message":{"text":"printing.format_object_summary (cyclomatic 25): printing.format_object_summary 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":"pandas/io/formats/printing.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"79126bddd8ec397cca9d3466a24addd6b131d594a233e156efc1869b1dc934dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Styler.to_latex (cyclomatic 25): Styler.to_latex 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":"pandas/io/formats/style.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1a0995ca3f07af7658c9e1b28a9e7623e2fb7f55604a9c51b193d1d356a539"}},{"ruleId":"D1","level":"warning","message":{"text":"parquet._get_path_or_handle (cyclomatic 25): parquet._get_path_or_handle 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":"pandas/io/parquet.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"450e1a6fab641dea04faadfd1210d9a482193e08b93699db6618f7e20f1ab95c"}},{"ruleId":"D1","level":"warning","message":{"text":"datetimes.date_range (cyclomatic 24): datetimes.date_range 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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e80978727b38baa9a83846d7f86108d20ff34ecb1f0da97ad7c856123221891"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiIndex._get_level_indexer (cyclomatic 24): MultiIndex._get_level_indexer 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":"pandas/core/indexes/multi.py"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbdc2d2989083a448df2b63ebb7730dee63c60f2705e59e912e3fca5ffb7db7"}},{"ruleId":"D1","level":"warning","message":{"text":"RangeIndex._concat (cyclomatic 24): RangeIndex._concat 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":"pandas/core/indexes/range.py"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"354d4dc024d0e82ad67612f8e27936e9c53693e3e2275ff1253c090a1abd5b0d"}},{"ruleId":"D1","level":"warning","message":{"text":"_LocIndexer._convert_to_indexer (cyclomatic 24): _LocIndexer._convert_to_indexer 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":"pandas/core/indexing.py"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b58afa538c5a3459d95db380d1bd4ae21792efe3e2c18adf60f0d9776740863"}},{"ruleId":"D1","level":"warning","message":{"text":"construction.to_arrays (cyclomatic 24): construction.to_arrays 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":"pandas/core/internals/construction.py"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ef6dc671e0271072e82d14b95e23a6b37d697e36aa463d15a37095448a8cdb"}},{"ruleId":"D1","level":"warning","message":{"text":"tile._bins_to_cuts (cyclomatic 24): tile._bins_to_cuts 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":"pandas/core/reshape/tile.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4215f2ce67543feae9588267e99fea24ab0a5e6a8e9f996d97d73ec639149478"}},{"ruleId":"D1","level":"warning","message":{"text":"HTMLFormatter._write_col_header (cyclomatic 24): HTMLFormatter._write_col_header 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":"pandas/io/formats/html.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa90355465ae1cde2a80bfa89af233c777ad7effc5f315cdc953b2d6169e11b"}},{"ruleId":"D1","level":"warning","message":{"text":"asserters.assert_extension_array_equal (cyclomatic 23): asserters.assert_extension_array_equal 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":"pandas/_testing/asserters.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d03c7fd66549377e596328d8881b0355f21b0d49bf19b857db0916c4f408c6"}},{"ruleId":"D1","level":"warning","message":{"text":"IntervalArray._cmp_method (cyclomatic 23): IntervalArray._cmp_method 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":"pandas/core/arrays/interval.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cfabd6f6def8b00e436bf950f5b4e66363a4a67f50b38a8f77ffbb71d581a9"}},{"ruleId":"D1","level":"warning","message":{"text":"BinOp.convert_value (cyclomatic 23): BinOp.convert_value 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":"pandas/core/computation/pytables.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b5ec49c42d71281332bc1b5d187ea811fe0c9b872bee8e1f44446fbc00d9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowDtype.type (cyclomatic 23): ArrowDtype.type has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bbda4ed4c02ba18453485c49c43594ac7edcd1791b1d9386a6ef1d981df291"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.set_index (cyclomatic 23): DataFrame.set_index 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. This shape REPEATS in the file: one other method here (DataFrame.set_index) 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":"pandas/core/frame.py"},"region":{"startLine":7753}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd11be2724a1175c2678e9b5fd4abb27c88f1246e8a9e21064a3bb748734e28"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.set_index (cyclomatic 23): DataFrame.set_index 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. This shape REPEATS in the file: one other method here (DataFrame.set_index) 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":"pandas/core/frame.py"},"region":{"startLine":7763}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b86184b9d333b0d544c3578569c3a53904ee00b02efc5cae6610a1d077e537"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame.filter (cyclomatic 23): NDFrame.filter 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":"pandas/core/generic.py"},"region":{"startLine":5675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ee804727b3aff4268b4560c708b0922b5e54581098fed5e62a08ce0a6c883a"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame.asof (cyclomatic 23): NDFrame.asof 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":"pandas/core/generic.py"},"region":{"startLine":8476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8307548c8c9e6f6e599411212d804b4f56068ef35b803fa1aef88726d49a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"base.get_values_for_csv (cyclomatic 23): base.get_values_for_csv 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":"pandas/core/indexes/base.py"},"region":{"startLine":8654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91165f9133021a9f9084af8895d8a663917f15cd84b6f50d2fd6eab75a71adc"}},{"ruleId":"D1","level":"warning","message":{"text":"indexing.infer_and_maybe_downcast (cyclomatic 23): indexing.infer_and_maybe_downcast 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":"pandas/core/indexing.py"},"region":{"startLine":4036}}}],"partialFingerprints":{"codehealthFindingId/v1":"767faceea7e2ab31fa11fb6331ef3f56ddd4defd4f975ee2363e0a3407c6d932"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseBlockManager._slice_take_blocks_ax0 (cyclomatic 23): BaseBlockManager._slice_take_blocks_ax0 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":"pandas/core/internals/managers.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4692d913ff82f6a6d0fa8b96e2daa07535d2f280e0642dcfed804b36326df95"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockManager.iset (cyclomatic 23): BlockManager.iset 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":"pandas/core/internals/managers.py"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"650bb3ad42e08f6461897770f2825f4138e360abb1ea64f07d452916e5195ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"MPLPlot.__init__ (cyclomatic 23): MPLPlot.__init__ 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"df27cb6e7c13d8700f06433271b23dfb906f5d87f19202a58e6c36156bc50be6"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray.__getitem__ (cyclomatic 22): ArrowExtensionArray.__getitem__ 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"424bbbbd80887e4ed89cb5f4be86f1d9d8220edb4d188efce3de384c4f25ed74"}},{"ruleId":"D1","level":"warning","message":{"text":"DatetimeLikeArrayMixin.__add__ (cyclomatic 22): DatetimeLikeArrayMixin.__add__ 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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec6023cc0e69c9b461cff2c9437c55384d52a606d0abafe6c884c55374786a4"}},{"ruleId":"D1","level":"warning","message":{"text":"DatetimeLikeArrayMixin.__sub__ (cyclomatic 22): DatetimeLikeArrayMixin.__sub__ 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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"57293970e37fa2b805a6f1ebf02c3727c5b597af1eb3aae32f8467222bffa1be"}},{"ruleId":"D1","level":"warning","message":{"text":"datetimes._generate_range (cyclomatic 22): datetimes._generate_range 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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee6def4f391d4a9fbc52c5568799286ffb77002d4aad7f7f96b50e27dbaffe1"}},{"ruleId":"D1","level":"warning","message":{"text":"SparseArray.__getitem__ (cyclomatic 22): SparseArray.__getitem__ 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7aaf307cc6015a51c5519c9d90c21aa396b9b07ba958b5ae53c649c147bc9e"}},{"ruleId":"D1","level":"warning","message":{"text":"TimedeltaArray.__mul__ (cyclomatic 22): TimedeltaArray.__mul__ 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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"166c74f32ed617b9124cc110434d82bff619254c6c72214e5dfdb8e835e338f0"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame._rename (cyclomatic 22): NDFrame._rename 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. This shape REPEATS in the file: one other method here (NDFrame._rename) 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":"pandas/core/generic.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2038a5453b321dabaff4515e079c2cdc9dd4ccadd4829a9295dc06f822b36c9"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame._rename (cyclomatic 22): NDFrame._rename 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. This shape REPEATS in the file: one other method here (NDFrame._rename) 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":"pandas/core/generic.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ea83d0697d87be0125860a239a8fb163810e5355720d02278f1fdd825619a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Index._maybe_downcast_for_indexing (cyclomatic 22): Index._maybe_downcast_for_indexing 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":"pandas/core/indexes/base.py"},"region":{"startLine":6689}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5692743486a5d18b46f4a8b248bc8bd773be9fd955f543c8cba90ff245a1d4"}},{"ruleId":"D1","level":"warning","message":{"text":"RangeIndex._union (cyclomatic 22): RangeIndex._union 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":"pandas/core/indexes/range.py"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"3524c2660730e3c81c8e70634fdede9a132d383a5ffdb991743e86070d5e83ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Block.replace_list (cyclomatic 22): Block.replace_list 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":"pandas/core/internals/blocks.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef8bfe181c10c2f18fc4da278eb28db8d4f2c038e5f24ceb6597a776280ac94"}},{"ruleId":"D1","level":"warning","message":{"text":"construction.dict_to_mgr (cyclomatic 22): construction.dict_to_mgr 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":"pandas/core/internals/construction.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"25048365504f234c88513e48b19c50164f5f4c50d166006bebebcb51ca2f4bdd"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._try_convert_to_date (cyclomatic 22): Parser._try_convert_to_date 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":"pandas/io/json/_json.py"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"431a8aa6f2467ed4600912fcfa71e11351d6e49cfc4a7883cdb577cf51c49379"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowParserWrapper._finalize_index (cyclomatic 22): ArrowParserWrapper._finalize_index 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":"pandas/io/parsers/arrow_parser_wrapper.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e617e12d0f68a431c7931f3e8fe099b9bfb40ce1df6aee6353b70b29274926e7"}},{"ruleId":"D1","level":"warning","message":{"text":"HDFStore._create_storer (cyclomatic 22): HDFStore._create_storer 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":"pandas/io/pytables.py"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a6dfbeeb7ab724d607ae60b5e78afc136594f09ecb0b99dbd8f00548920d6c"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericFixed.write_array (cyclomatic 22): GenericFixed.write_array 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":"pandas/io/pytables.py"},"region":{"startLine":3929}}}],"partialFingerprints":{"codehealthFindingId/v1":"22796223e0320de330078c6582c45b388b1e92c9e5c9384e65c6db2f48603013"}},{"ruleId":"D1","level":"warning","message":{"text":"BarPlot._make_plot (cyclomatic 22): BarPlot._make_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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1337fa94ce38effdf1651301b3a60c720cf6e09f30bdeca77fb0f0cbc7ed692d"}},{"ruleId":"D1","level":"warning","message":{"text":"apply.reconstruct_func (cyclomatic 21): apply.reconstruct_func 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":"pandas/core/apply.py"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"2751d85b35a3d569c4ba7c85bc70cf7ebb8cd59b4f1de4873ea7540f41a2c4df"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray._box_pa_scalar (cyclomatic 21): ArrowExtensionArray._box_pa_scalar 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"7707841b1b85cf866fab87bb29890a4c7a8a3f5d9c31efb04d8dc3bc69c1fbc4"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray.to_numpy (cyclomatic 21): ArrowExtensionArray.to_numpy 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"318edbfc8a0bce92150b0bb10f9588b49cdbda30e998090c5cbca5a4c989eb0a"}},{"ruleId":"D1","level":"warning","message":{"text":"StringArray._cmp_method (cyclomatic 21): StringArray._cmp_method 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":"pandas/core/arrays/string_.py"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cbf2b461d5983f3702ffec650b2b847844105b6cd31b5175335a95b504dd30"}},{"ruleId":"D1","level":"warning","message":{"text":"cast.infer_dtype_from_scalar (cyclomatic 21): cast.infer_dtype_from_scalar 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9a50e4ef062814ad616dff4d033817f1e096023051425076a44da8ee34c4bf"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.__getitem__ (cyclomatic 21): DataFrame.__getitem__ 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":"pandas/core/frame.py"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d1cde8659de348dcc85dd7c4932afa1b7d7733df5983251d40aafe7f63cd1e"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.shift (cyclomatic 21): DataFrame.shift 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":"pandas/core/frame.py"},"region":{"startLine":7511}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfaee705491b1953679560e1aafafc0b9c0b1cc405d49effff277f85e797bfe8"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiIndex._reorder_indexer (cyclomatic 21): MultiIndex._reorder_indexer 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":"pandas/core/indexes/multi.py"},"region":{"startLine":4511}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b54ef45a1080e1d2e25bfaf53d1f262a10770e94d9a6c8208fd471d3bca7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"_LocIndexer._getitem_axis (cyclomatic 21): _LocIndexer._getitem_axis 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":"pandas/core/indexing.py"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab01da8b5fbba25191371a69ba71bf02bd11960fd428b7ad1fb4e7c52fcc4ed4"}},{"ruleId":"D1","level":"warning","message":{"text":"datetimes._to_datetime_with_unit (cyclomatic 21): datetimes._to_datetime_with_unit 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":"pandas/core/tools/datetimes.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bde673a23d14c85e1407fff15c33bc357778937cf61814f7bc317b2d57d224"}},{"ruleId":"D1","level":"warning","message":{"text":"HTMLFormatter._write_hierarchical_rows (cyclomatic 21): HTMLFormatter._write_hierarchical_rows 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":"pandas/io/formats/html.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b2804e0442f071efac209008e8137512335500a2883cd5e305bf435e8c2647"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonParser._rows_to_cols (cyclomatic 21): PythonParser._rows_to_cols 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"205176fcee1d690ac6317dd7297019f53d7ff65bfe8fad875248ede43fdbe055"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexCol.convert (cyclomatic 21): IndexCol.convert 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":"pandas/io/pytables.py"},"region":{"startLine":2753}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bab3af8f41e14db060c99868648c013044d256431d792daad9d946f8eafe051"}},{"ruleId":"D1","level":"warning","message":{"text":"AppendableFrameTable.read (cyclomatic 21): AppendableFrameTable.read 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":"pandas/io/pytables.py"},"region":{"startLine":5714}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85fdd1e6c043ec6d1ba74cc4f45bbecf6a7765f39b0e7c11098dc50ad2a926f"}},{"ruleId":"D1","level":"warning","message":{"text":"_XMLFrameParser._parse_nodes (cyclomatic 21): _XMLFrameParser._parse_nodes 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":"pandas/io/xml.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a107d3b9971a49cc04bb73a3e2788c1618f401d880fb00eca6252189ff2d9c1"}},{"ruleId":"D1","level":"warning","message":{"text":"_testing.shares_memory (cyclomatic 20): _testing.shares_memory has cyclomatic complexity 20 (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":"pandas/_testing/__init__.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e7d587a9b1560f38a9a0a47703e44af13828d0e6521eafa1cc740f8eef5345"}},{"ruleId":"D1","level":"warning","message":{"text":"algorithms.diff (cyclomatic 20): algorithms.diff has cyclomatic complexity 20 (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":"pandas/core/algorithms.py"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f0c790f41dfe3c62317c331608a256ed90705332bb8a59bef4f3b4115c5d23"}},{"ruleId":"D1","level":"warning","message":{"text":"NDFrame.xs (cyclomatic 20): NDFrame.xs 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":"pandas/core/generic.py"},"region":{"startLine":4194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d1355f62d157982b96d27219e2f456558010a92fb03dc40c728500bebbed4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Index.set_names (cyclomatic 20): Index.set_names has cyclomatic complexity 20 (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. This shape REPEATS in the file: one other method here (Index.set_names) 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":"pandas/core/indexes/base.py"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd1c419d45a34d6e6e4511f72e0ad036f95db4ef45c596e3b2fe851df7cd655"}},{"ruleId":"D1","level":"warning","message":{"text":"Index.set_names (cyclomatic 20): Index.set_names has cyclomatic complexity 20 (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. This shape REPEATS in the file: one other method here (Index.set_names) 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":"pandas/core/indexes/base.py"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"66977cc2b7f5cb74824bfaf1d6fef0d9230d25b837377f62a5d8722b1f692f96"}},{"ruleId":"D1","level":"warning","message":{"text":"_MergeOperation._get_merge_keys (cyclomatic 20): _MergeOperation._get_merge_keys 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc19adeb1cf19706afc2193b22083752cb28b635b5ffc10fc86bf194a8c9db0d"}},{"ruleId":"D1","level":"warning","message":{"text":"pivot._add_margins (cyclomatic 20): pivot._add_margins 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":"pandas/core/reshape/pivot.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bd5cc8effa1701c6f9f294e89adecee72589c36be6ff39086f7beb68dd9dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"common.flex_binary_moment (cyclomatic 20): common.flex_binary_moment 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":"pandas/core/window/common.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7bc6a2f7c7fb89a6faf53030901e964dbaf6c6958df116528da34ac7aad77c"}},{"ruleId":"D1","level":"warning","message":{"text":"clipboard.determine_clipboard (cyclomatic 20): clipboard.determine_clipboard 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":"pandas/io/clipboard/__init__.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2d0aa496d81fe870d8a2cc9608bf3c9ef2b9e4b236ea92439f27669649ea31"}},{"ruleId":"D1","level":"warning","message":{"text":"StylerRenderer._translate_latex (cyclomatic 20): StylerRenderer._translate_latex 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":"pandas/io/formats/style_render.py"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"e521015690ba5114e4eb82372f0719e4e29de46553074ec3d6287c4778abe068"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray._cmp_method (cyclomatic 19): ArrowExtensionArray._cmp_method 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"16551bb297c8b372ecaa376b1ada18a2c2262e46b6edc15ace70dd6651786d36"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowExtensionArray.__setitem__ (cyclomatic 19): ArrowExtensionArray.__setitem__ 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":3340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0434bf2eeef5b36ca04ca8aa114b8a28f07c3f78f0efc773fdf108ac3a90fe0a"}},{"ruleId":"D1","level":"warning","message":{"text":"PeriodArray._from_sequence (cyclomatic 19): PeriodArray._from_sequence 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":"pandas/core/arrays/period.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f62e9586d9451135b07c5b95e9d59e4b4ded5c2a4b8b147a0355619e4dc54d6"}},{"ruleId":"D1","level":"warning","message":{"text":"missing.array_equivalent (cyclomatic 19): missing.array_equivalent 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":"pandas/core/dtypes/missing.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9c8b61b02e2660d8a2322a16474ebcadc35238c5ad9a1fea7df46e265bcce2"}},{"ruleId":"D1","level":"warning","message":{"text":"missing._array_equivalent_object (cyclomatic 19): missing._array_equivalent_object 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":"pandas/core/dtypes/missing.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"202f9f12307a64cbe869e4104eba2d11c7c10ce3687053396d46d544a1339c5e"}},{"ruleId":"D1","level":"warning","message":{"text":"missing.is_valid_na_for_dtype (cyclomatic 19): missing.is_valid_na_for_dtype 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":"pandas/core/dtypes/missing.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c93c95a52b9ed9e9b7e768af7828ba408c2a5537581b9da9ec6c9f9a9211106"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.join (cyclomatic 19): DataFrame.join 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":"pandas/core/frame.py"},"region":{"startLine":15764}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57a545c9492bb7ac39cd25fdc85bec8368c8aeea1c6e2859aeef0b68ec7a003"}},{"ruleId":"D1","level":"warning","message":{"text":"GroupBy._value_counts (cyclomatic 19): GroupBy._value_counts 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"03db0fc75703c68a7ffe421004015e1817fbe720d360704d46e02cdec8fe0627"}},{"ruleId":"D1","level":"warning","message":{"text":"base.maybe_sequence_to_range (cyclomatic 19): base.maybe_sequence_to_range 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":"pandas/core/indexes/base.py"},"region":{"startLine":8332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a9909323f6cd7e17f93e6ad517be06d24db032da5e04d5316c07d0c31945db"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseBlockManager.setitem (cyclomatic 19): BaseBlockManager.setitem 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":"pandas/core/internals/managers.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c24ffacaf3297b510833c56548cc8465862cd683ed99b6d2e4fab2d80750cf"}},{"ruleId":"D1","level":"warning","message":{"text":"missing._interpolate_1d (cyclomatic 19): missing._interpolate_1d 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":"pandas/core/missing.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01fabc76fa3d1d6d2a2a8d0f9ca01272d021fa4e63a7a7759a7737b7be8e383"}},{"ruleId":"D1","level":"warning","message":{"text":"sorting.lexsort_indexer (cyclomatic 19): sorting.lexsort_indexer 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":"pandas/core/sorting.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5feb910bde7dfd9a632d72c70c5a51dcac9f824010b3ccbb30cf83dcfa2ff563"}},{"ruleId":"D1","level":"warning","message":{"text":"StringMethods.cat (cyclomatic 19): StringMethods.cat 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":"pandas/core/strings/accessor.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18ee04c6a69a876d0bf55dcd7377351e05b60233f746fe586f5a066c7a051cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ExcelFormatter._format_hierarchical_rows (cyclomatic 19): ExcelFormatter._format_hierarchical_rows 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":"pandas/io/formats/excel.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42ed2636416ebfd04594e0a206265d9f81cd59440780377c679a181e2ee434d"}},{"ruleId":"D1","level":"warning","message":{"text":"style._bar (cyclomatic 19): style._bar 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":"pandas/io/formats/style.py"},"region":{"startLine":4442}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf6f210950610b78b04595905e221b451020f1fd922c899a13267210bd86a75"}},{"ruleId":"D1","level":"warning","message":{"text":"_json._validate_pyarrow_engine_options (cyclomatic 19): _json._validate_pyarrow_engine_options 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":"pandas/io/json/_json.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"599882a181e5b0736c79f2322d4adc4058f632d8580912c2f3900a4953999863"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserBase._agg_index (cyclomatic 19): ParserBase._agg_index 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":"pandas/io/parsers/base_parser.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77a2e45c423894351869d74af66885eca3cf4e979d38c6b4f8910bcf3405d34"}},{"ruleId":"D1","level":"warning","message":{"text":"CParserWrapper.__init__ (cyclomatic 19): CParserWrapper.__init__ 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":"pandas/io/parsers/c_parser_wrapper.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"860983a3e7b3520058b319ac622d9d0a9805c2af55eff43d06773adc244aef17"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonParser._next_line (cyclomatic 19): PythonParser._next_line 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c75ab513a809f0f56dc35961499fb01b2b50ef09e7b45cebc8e75da0f1a8d1"}},{"ruleId":"D1","level":"warning","message":{"text":"Table.create_index (cyclomatic 19): Table.create_index 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":"pandas/io/pytables.py"},"region":{"startLine":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d9e04441354fa4b35785688d282ca6da7b5b6e24645c4808e1e9ad610d1e81"}},{"ruleId":"D1","level":"warning","message":{"text":"pytables._maybe_convert_for_string_atom (cyclomatic 19): pytables._maybe_convert_for_string_atom 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":"pandas/io/pytables.py"},"region":{"startLine":6344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0a1bf5a1b37d60bc77b480f7c9f8ac03dfc3534417bc150efd16ddc6b3f33f"}},{"ruleId":"D1","level":"warning","message":{"text":"tools.create_subplots (cyclomatic 19): tools.create_subplots 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":"pandas/plotting/_matplotlib/tools.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad430813f3069b8efdcd0c7a85bbb3be023b8476c58d6e9b73f9cfcb295aaf88"}},{"ruleId":"D1","level":"warning","message":{"text":"frequencies.is_subperiod (cyclomatic 19): frequencies.is_subperiod 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. This shape REPEATS in the file: one other method here (frequencies.is_superperiod) 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":"pandas/tseries/frequencies.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf511253f073324f6c0ff0950c401272f29ab6e3c0949c46093857877f3bb15"}},{"ruleId":"D1","level":"warning","message":{"text":"frequencies.is_superperiod (cyclomatic 19): frequencies.is_superperiod 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. This shape REPEATS in the file: one other method here (frequencies.is_subperiod) 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":"pandas/tseries/frequencies.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c3fdb3209d03e9b6630d1fca22f8e2a8f896373e9ccc4066425ff23df8028e"}},{"ruleId":"D1","level":"warning","message":{"text":"_utils.to_numpy_dtype_inference (cyclomatic 18): _utils.to_numpy_dtype_inference 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":"pandas/core/arrays/_utils.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95d848d6dbff65d2fb944859aaf63b68c15f90155b6ffffcc293363004345de"}},{"ruleId":"D1","level":"warning","message":{"text":"SparseArray._reduce (cyclomatic 18): SparseArray._reduce 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce0f7b8cec5bd66b8cb24e21799870ff5eb8dc8234fcf186d32cf7acc006122"}},{"ruleId":"D1","level":"warning","message":{"text":"astype._astype_nansafe (cyclomatic 18): astype._astype_nansafe 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":"pandas/core/dtypes/astype.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ef8e27f9c4de66f11b3061741c4ce655355112a6e8f9e02c19d3e50fa0c09c"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame._set_item_frame_value (cyclomatic 18): DataFrame._set_item_frame_value 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":"pandas/core/frame.py"},"region":{"startLine":4815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2894f4fc96dee5da0cbc3916fbfccfd0967943bee810897af7281a4180339b7"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.reset_index (cyclomatic 18): DataFrame.reset_index 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":"pandas/core/frame.py"},"region":{"startLine":8065}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bab38f622526001ded70e1c49dee489232de224ced04fb768d9d54feb5b6093"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.quantile (cyclomatic 18): DataFrame.quantile 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 (DataFrame.quantile) 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":"pandas/core/frame.py"},"region":{"startLine":19720}}}],"partialFingerprints":{"codehealthFindingId/v1":"4842e209fe1bf4d9d67de18fba4b2fb5ada02c483f62573e77b7b6d73d9987e3"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.quantile (cyclomatic 18): DataFrame.quantile 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 (DataFrame.quantile) 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":"pandas/core/frame.py"},"region":{"startLine":19729}}}],"partialFingerprints":{"codehealthFindingId/v1":"487f728b65507e72aab0b5bf08a8a423d11ae320350250b6e8ce1988954b748c"}},{"ruleId":"D1","level":"warning","message":{"text":"SeriesGroupBy.value_counts (cyclomatic 18): SeriesGroupBy.value_counts 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":"pandas/core/groupby/generic.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07f02c4dda33c1e17dc1b377129656bd2698b24175c26e4194a52e6402709bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Index.get_indexer (cyclomatic 18): Index.get_indexer 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":"pandas/core/indexes/base.py"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"72113ba37c9c8950bf7e2776e4b596a484b6aecc0d7605d79943e20688b44f74"}},{"ruleId":"D1","level":"warning","message":{"text":"Index._join_level (cyclomatic 18): Index._join_level 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":"pandas/core/indexes/base.py"},"region":{"startLine":4954}}}],"partialFingerprints":{"codehealthFindingId/v1":"03953a26e1ed9644c25ea8e0cd4144e545d9b3f29dbf3bbe60587f1b8bf59a5a"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiIndex._partial_tup_index (cyclomatic 18): MultiIndex._partial_tup_index 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":"pandas/core/indexes/multi.py"},"region":{"startLine":3570}}}],"partialFingerprints":{"codehealthFindingId/v1":"2498183d8f61f0ff18c0924da84937f217bc4f76be186e3e3d6370200ae05b5b"}},{"ruleId":"D1","level":"warning","message":{"text":"_LocationIndexer._maybe_restore_dropped_levels (cyclomatic 18): _LocationIndexer._maybe_restore_dropped_levels 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":"pandas/core/indexing.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8bc5cb7ffb12ead83a826b040e27005fc8828f5827b666e07892695f141806"}},{"ruleId":"D1","level":"warning","message":{"text":"_iLocIndexer._setitem_single_block (cyclomatic 18): _iLocIndexer._setitem_single_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":"pandas/core/indexing.py"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"d457252dbb72f9eea2ba4e9059b68657f199457f55349531a5d4d48ab4a7cfbd"}},{"ruleId":"D1","level":"warning","message":{"text":"_iLocIndexer._align_frame (cyclomatic 18): _iLocIndexer._align_frame 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":"pandas/core/indexing.py"},"region":{"startLine":3352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0579135a0b0b2b006cb7c44ada759051170e069e03feeb9497025592956931"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionBlock._unwrap_setitem_indexer (cyclomatic 18): ExtensionBlock._unwrap_setitem_indexer 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":"pandas/core/internals/blocks.py"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"903d46e7e3ec1a239f2b86acf3e8d828153aece8ea8461ee4f68db4d18195d41"}},{"ruleId":"D1","level":"warning","message":{"text":"construction._extract_index (cyclomatic 18): construction._extract_index 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":"pandas/core/internals/construction.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f094a9aeae7d6d4d704ed84dcfc25a787e0edf29dddcc38afc7bdd25a36e3a"}},{"ruleId":"D1","level":"warning","message":{"text":"encoding.from_dummies (cyclomatic 18): encoding.from_dummies 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":"pandas/core/reshape/encoding.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc942c6696b9639da0d188ae6f02909ed34d7712eafd92c7a28358247b85e02"}},{"ruleId":"D1","level":"warning","message":{"text":"datetimes._adjust_to_origin (cyclomatic 18): datetimes._adjust_to_origin 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":"pandas/core/tools/datetimes.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"482376db1b08d6dee7c168de14685c6bc8db7d3a50a6764a78a4451764ea4b88"}},{"ruleId":"D1","level":"warning","message":{"text":"style_render._get_level_lengths (cyclomatic 18): style_render._get_level_lengths 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":"pandas/io/formats/style_render.py"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a5165190026d4613ce2562efbe9b9e65c4480c88169f8c94826103135ffd86"}},{"ruleId":"D1","level":"warning","message":{"text":"_HtmlFrameParser._expand_colspan_rowspan (cyclomatic 18): _HtmlFrameParser._expand_colspan_rowspan 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":"pandas/io/html.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"3527a119f059be25d46f8f83bb1f71c822d7de6926556f5ccc0e99e695ea00ae"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonParser._convert_to_ndarrays (cyclomatic 18): PythonParser._convert_to_ndarrays 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9131d180f69aa53c756df55f8641082d5606f7e3bb3832f0b83ece62964df8"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonParser._cast_types (cyclomatic 18): PythonParser._cast_types 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f72d42f6a504e7606206de83685caf024441cb6331d13bb1dc48b0f52e746a"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonParser._get_lines (cyclomatic 18): PythonParser._get_lines 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4185967c9f2d70d30a495ef2fc2ede1ca847e2a9517e975bba9726cb2815c18f"}},{"ruleId":"D1","level":"warning","message":{"text":"readers._read (cyclomatic 18): readers._read 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":"pandas/io/parsers/readers.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a46ae616ab3c0ea74e667c8fc856be4a5b677a8b77944b740772222fd841da"}},{"ruleId":"D1","level":"warning","message":{"text":"readers.read_fwf (cyclomatic 18): readers.read_fwf 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":"pandas/io/parsers/readers.py"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fb21921af3d42f9e771dd35a8055753fdaf4a86c2aeba8267ef539a0fcd150"}},{"ruleId":"D1","level":"warning","message":{"text":"readers._refine_defaults_read (cyclomatic 18): readers._refine_defaults_read 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":"pandas/io/parsers/readers.py"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b42f544b75b4919191941857e9eadaed3d1ecbe7300e79d59bf37c267c599c4"}},{"ruleId":"D1","level":"warning","message":{"text":"DataCol.convert (cyclomatic 18): DataCol.convert 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":"pandas/io/pytables.py"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacdd44736afc3da6e93654e33dee14610d7717d3a3109ca290ddc331ba672c2"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLTable._sqlalchemy_type (cyclomatic 18): SQLTable._sqlalchemy_type 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":"pandas/io/sql/base.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"3622322eb838574ce09907ac667245fefc0c71bb3e87e22dc6ed56027edcfce9"}},{"ruleId":"D1","level":"warning","message":{"text":"tools.handle_shared_axes (cyclomatic 18): tools.handle_shared_axes 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":"pandas/plotting/_matplotlib/tools.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75bd8b287ec8112ae6278ba210aa24f5c97d35d1d3e4c0c5ea4e65b6dfdc452"}},{"ruleId":"D1","level":"warning","message":{"text":"algorithms.map_array (cyclomatic 17): algorithms.map_array 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":"pandas/core/algorithms.py"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"884bb3ab8eeeec44160523de58973b0806dec01db089fc72bb6731de01a7a3af"}},{"ruleId":"D1","level":"warning","message":{"text":"take.take_2d_multi (cyclomatic 17): take.take_2d_multi 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":"pandas/core/array_algos/take.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7b547e3a3c8fb14c325ad7943e2c70b56211024ded5b450f4c83778cb9e1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Categorical._maybe_convert_categories (cyclomatic 17): Categorical._maybe_convert_categories 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":"pandas/core/arrays/categorical.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fd09a45146a70af9056b5f810b0898a6ba125289c0b631f6537663b5eda78a"}},{"ruleId":"D1","level":"warning","message":{"text":"DatetimeLikeArrayMixin._cmp_method (cyclomatic 17): DatetimeLikeArrayMixin._cmp_method 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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa144f7364150d23fb0bba07f4ef64fc06f10174a27cc1c0d61d3a24cc227da"}},{"ruleId":"D1","level":"warning","message":{"text":"array._sparse_array_op (cyclomatic 17): array._sparse_array_op 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d038118a733b7107a6cb8955ef928cbe588d2cd18a3de582fef1916b42628ece"}},{"ruleId":"D1","level":"warning","message":{"text":"parsing._split_by_backtick (cyclomatic 17): parsing._split_by_backtick 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":"pandas/core/computation/parsing.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"868e117bc16f639350c521141b94e365864c829f5b3a6d6a27059d1f7f9db429"}},{"ruleId":"D1","level":"warning","message":{"text":"IntervalDtype.__init__ (cyclomatic 17): IntervalDtype.__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":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2645566787d0adb73cfa4e7b12797ecaf1793798d09f5de185c4eaae9fb2dce9"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.dropna (cyclomatic 17): DataFrame.dropna 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":"pandas/core/frame.py"},"region":{"startLine":8644}}}],"partialFingerprints":{"codehealthFindingId/v1":"718a1a427e968b35e2b8151c13677c32d088f67d23daac4f94fb4e1b91893130"}},{"ruleId":"D1","level":"warning","message":{"text":"Index._cmp_method (cyclomatic 17): Index._cmp_method 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":"pandas/core/indexes/base.py"},"region":{"startLine":7799}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46ae7aa7a3cfe750953cded513441aae80fc491149f3247fd266b94708de842"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiIndex._verify_integrity (cyclomatic 17): MultiIndex._verify_integrity 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":"pandas/core/indexes/multi.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"663e9136d550ab6a5ef1c61cdd16e00817eeb206f337661b48b5f96eb9bead02"}},{"ruleId":"D1","level":"warning","message":{"text":"_iLocIndexer._setitem_with_indexer_missing (cyclomatic 17): _iLocIndexer._setitem_with_indexer_missing 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":"pandas/core/indexing.py"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f94aec3c1c96666997f5394b80d0e1e487d7b22802522d71b686e4f1c42e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Block.where (cyclomatic 17): Block.where 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":"pandas/core/internals/blocks.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1306a7dbbf8afb4b5f05e7183766ca8b6676404622fe90ca6f07ade4fdf4e7c3"}},{"ruleId":"D1","level":"warning","message":{"text":"concat._clean_keys_and_objs (cyclomatic 17): concat._clean_keys_and_objs 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":"pandas/core/reshape/concat.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"8076a3cfa58e351b37695f8700eb436c91b5d9077dcf94a71720da6d089e8ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"_MergeOperation._get_join_info (cyclomatic 17): _MergeOperation._get_join_info 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aa9505feb63d1af4f1138727f855395f18b2a0fc0bb67f5268e0068e34e9f2"}},{"ruleId":"D1","level":"warning","message":{"text":"reshape._stack_multi_columns (cyclomatic 17): reshape._stack_multi_columns 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":"pandas/core/reshape/reshape.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d13246e464c351a4166a09f5fafbb581cfb5efb08f7d46fb949b2192feaf502"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseWindow._validate (cyclomatic 17): BaseWindow._validate 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":"pandas/core/window/rolling.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"913d0bbec1a2e912c906d1f0239be8e3ec83c76145afaf6b0c49716fb558ed69"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenpyxlWriter._write_cells_write_only (cyclomatic 17): OpenpyxlWriter._write_cells_write_only 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":"pandas/io/excel/_openpyxl.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa898d153eb3736370ea907d99699bffb1565f04cd0a32e77a95a8a38f28337"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenpyxlWriter._write_cells_normal (cyclomatic 17): OpenpyxlWriter._write_cells_normal 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":"pandas/io/excel/_openpyxl.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"13247a7fa5fc55fd4a7020ca6acd15363d005c14f6c188305dea0a108de5980b"}},{"ruleId":"D1","level":"warning","message":{"text":"_XlsxStyler.convert (cyclomatic 17): _XlsxStyler.convert 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":"pandas/io/excel/_xlsxwriter.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bc17662a356b5308e7adffa8d7e208917e99607b5ddc67b567690745da0d49"}},{"ruleId":"D1","level":"warning","message":{"text":"MPLPlot._parse_errorbars (cyclomatic 17): MPLPlot._parse_errorbars 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"610075d0107a056b2f2b60a38ea24cd41775234e8f8881756822981a1a79e296"}},{"ruleId":"D1","level":"warning","message":{"text":"hist.hist_series (cyclomatic 17): hist.hist_series 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":"pandas/plotting/_matplotlib/hist.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbecbb49d77472f4c7ef0844767fd2dc556caed5d503650e23d50d512d4c95e"}},{"ruleId":"D1","level":"warning","message":{"text":"tools._get_layout (cyclomatic 17): tools._get_layout 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":"pandas/plotting/_matplotlib/tools.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df120dd4c1ba32bc24a43c7f31b9b853cc51268a15f885951d4c5d65712702d"}},{"ruleId":"D1","level":"warning","message":{"text":"mean_.sliding_mean (cyclomatic 16): mean_.sliding_mean 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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"54486b0ad8b11ceda5bf6bf308a1d8b3f999e140d30d47251286fa1b7e13bb55"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowStringArray._from_sequence (cyclomatic 16): ArrowStringArray._from_sequence 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":"pandas/core/arrays/string_arrow.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5da1260826ad26575b7f781e2add01065ebe729ea66f9986ef40c77aa606b5"}},{"ruleId":"D1","level":"warning","message":{"text":"grouper._factorize_monotonic (cyclomatic 16): grouper._factorize_monotonic 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":"pandas/core/groupby/grouper.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"be760980999d84ab0d28c35ab2866865d6b9dc7cb357a7af47088a0ce40a681a"}},{"ruleId":"D1","level":"warning","message":{"text":"DatetimeTimedeltaMixin._get_arithmetic_result_freq (cyclomatic 16): DatetimeTimedeltaMixin._get_arithmetic_result_freq 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":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9686439fe01aa56fa6e492a5adea7666933c602cfad95bf0d1d1e26b266df95"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiIndex.get_loc (cyclomatic 16): MultiIndex.get_loc 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":"pandas/core/indexes/multi.py"},"region":{"startLine":3660}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc364884795546f678b7020b5b6793b5f0096919dea31844514bfbb7f13ce100"}},{"ruleId":"D1","level":"warning","message":{"text":"range._exact_int64_targets (cyclomatic 16): range._exact_int64_targets 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":"pandas/core/indexes/range.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5a1c90e77be912868322ecb0fc226de351b4c67f868e24863b87dadd32df95"}},{"ruleId":"D1","level":"warning","message":{"text":"_iLocIndexer._validate_key (cyclomatic 16): _iLocIndexer._validate_key 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":"pandas/core/indexing.py"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"74531a32b82cf01cfc284d49684e7d8a3158be9adf9ede06b3cb5e08a9f502d5"}},{"ruleId":"D1","level":"warning","message":{"text":"_iLocIndexer._decide_split_path (cyclomatic 16): _iLocIndexer._decide_split_path 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":"pandas/core/indexing.py"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5a1e283b1add60e6e29905ad427a05c71e20d531bbf34a920dd178c2468478"}},{"ruleId":"D1","level":"warning","message":{"text":"_iLocIndexer._setitem_new_column (cyclomatic 16): _iLocIndexer._setitem_new_column 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":"pandas/core/indexing.py"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c59cc4698311db6f80f47e7e380beaa0c89d94fce7de1b20c3bbeb29958d5d9"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockManager.as_array (cyclomatic 16): BlockManager.as_array 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":"pandas/core/internals/managers.py"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5ef0b87e0490cddad6ef8fa2350e6baea54f00f9f96fe9dcc67493f474fb2f"}},{"ruleId":"D1","level":"warning","message":{"text":"select.select (cyclomatic 16): select.select 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":"pandas/core/methods/select.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"479d6864c67c077fc923fa3a35e87fcde4b1a365093acdf01c747c3c416462dc"}},{"ruleId":"D1","level":"warning","message":{"text":"nanops._sum_timedelta_i8 (cyclomatic 16): nanops._sum_timedelta_i8 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":"pandas/core/nanops.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd50d8c322291fb8f45865743a1f03457f9b65f40c23224fdcb58231346fbbef"}},{"ruleId":"D1","level":"warning","message":{"text":"array_ops.comparison_op (cyclomatic 16): array_ops.comparison_op 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":"pandas/core/ops/array_ops.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4c69fc47abd0de824f80dac781291dd50bdee2d093b0880a74d3c9841996be"}},{"ruleId":"D1","level":"warning","message":{"text":"resample._adjust_dates_anchored (cyclomatic 16): resample._adjust_dates_anchored 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":"pandas/core/resample.py"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b546d156fa08aba087a0770ebf1b2be0e0b484ed533fafceb576116d5318197"}},{"ruleId":"D1","level":"warning","message":{"text":"pivot.pivot (cyclomatic 16): pivot.pivot 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":"pandas/core/reshape/pivot.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea28aea6db2c62df3cb751c5920e15ffe39bcc8b007263ea15437c20777951a"}},{"ruleId":"D1","level":"warning","message":{"text":"reshape.stack_v3 (cyclomatic 16): reshape.stack_v3 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":"pandas/core/reshape/reshape.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc277c2e1993f69154e3107c09e49dfe6686e47e9815e0f96f94a3f7169fdeaa"}},{"ruleId":"D1","level":"warning","message":{"text":"StringMethods.replace (cyclomatic 16): StringMethods.replace 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":"pandas/core/strings/accessor.py"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"64af15483ee74ec58a3b2b252dfa4ce102a172de52b743a97fb91e4930230849"}},{"ruleId":"D1","level":"warning","message":{"text":"SeriesFormatter._get_footer (cyclomatic 16): SeriesFormatter._get_footer 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":"pandas/io/formats/format.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"88824f1a1aca003540238a702e5bb71d7926482a54d1cb681b36ba81cac19904"}},{"ruleId":"D1","level":"warning","message":{"text":"printing._pprint_seq (cyclomatic 16): printing._pprint_seq 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":"pandas/io/formats/printing.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e643277fee47453a337b83bd6d67a36f03169b36b34dcb7717f3159b3b8185"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowParserWrapper.read (cyclomatic 16): ArrowParserWrapper.read 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":"pandas/io/parsers/arrow_parser_wrapper.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"311ad1cb3aff4bffa669bfc730c10e87581a67d05dac2adce29873724eccc75a"}},{"ruleId":"D1","level":"warning","message":{"text":"HDFStore.append_to_multiple (cyclomatic 16): HDFStore.append_to_multiple 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":"pandas/io/pytables.py"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"14462874ad833f94fde8046ce09ad6e122add38447f725bef5f6256933fb2cac"}},{"ruleId":"D1","level":"warning","message":{"text":"pytables._convert_index (cyclomatic 16): pytables._convert_index 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":"pandas/io/pytables.py"},"region":{"startLine":6173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9832620c29f0831ba3bac79ca7c0575815afb1142d43064c83fd3156937ce210"}},{"ruleId":"D1","level":"warning","message":{"text":"XportReader._read_header (cyclomatic 16): XportReader._read_header 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":"pandas/io/sas/sas_xport.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4478b8f31f1a1b0406a6d84ee6a06f6bf41a47f1384a1b1157cd8478073e7111"}},{"ruleId":"D1","level":"warning","message":{"text":"MPLPlot._adorn_subplots (cyclomatic 16): MPLPlot._adorn_subplots 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4172f1266196a20b442e6ad79bb6c41e2d1ba69dfc6bcfb2cae26bdfc6aea4"}},{"ruleId":"D2","level":"warning","message":{"text":"cast.np_can_hold_element (cognitive 172): cast.np_can_hold_element has cognitive complexity 172 (threshold 15). Drivers by points: if/else 51 (142 pts), ternaries 3 (13 pts), boolean chains 12, error handling 1 (5 pts) (nesting depth added 105). 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf311bead3f746ae5c357144c5a080beef30d45d86c53fbea146fe96a190d32"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex._get_locs (cognitive 133): MultiIndex._get_locs has cognitive complexity 133 (threshold 15). Drivers by points: if/else 34 (100 pts), ternaries 2 (10 pts), loops 4 (9 pts), boolean chains 7, error handling 2 (7 pts) (nesting depth added 84). 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":"pandas/core/indexes/multi.py"},"region":{"startLine":4223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f954db0188a7d09ccb7255874543fbfd4a8fc63f2400ac4fa5d8383dda530477"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex._get_loc_level (cognitive 116): MultiIndex._get_loc_level has cognitive complexity 116 (threshold 15). Drivers by points: if/else 30 (85 pts), error handling 5 (14 pts), boolean chains 7, loops 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 70). 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":"pandas/core/indexes/multi.py"},"region":{"startLine":3860}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d92684f1fd2ac45c607445c5a26332eb85c8cdec4c5a55b88d82c674774750"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._infer_columns (cognitive 112): PythonParser._infer_columns has cognitive complexity 112 (threshold 15). Drivers by points: if/else 29 (76 pts), ternaries 3 (13 pts), boolean chains 9, loops 3 (8 pts), error handling 2 (6 pts) (nesting depth added 66). 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8848816f55ab80281b0e30b13c98bf417f38296c3f0abfee7df4a1d1309ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"_MergeOperation._maybe_add_join_keys (cognitive 108): _MergeOperation._maybe_add_join_keys has cognitive complexity 108 (threshold 15). Drivers by points: if/else 26 (77 pts), ternaries 4 (20 pts), boolean chains 10, loops 1 (nesting depth added 67). 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3ece443657def95a0592ba4a3a4d4f57aa31aa150fec11f296361f45ade206"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame._where (cognitive 101): NDFrame._where has cognitive complexity 101 (threshold 15). Drivers by points: if/else 41 (87 pts), boolean chains 9, loops 1 (4 pts), ternaries 1 (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":"pandas/core/generic.py"},"region":{"startLine":10411}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ad34e9ba297bac9e31ecb5d9693313a19c3ed18582f3401d6de5bbe22b81e4"}},{"ruleId":"D2","level":"warning","message":{"text":"readers._read_csv_chunks (cognitive 101): readers._read_csv_chunks has cognitive complexity 101 (threshold 15). Drivers by points: if/else 36 (50 pts), loops 13 (24 pts), boolean chains 13, error handling 4 (8 pts), ternaries 5 (6 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":"pandas/io/parsers/readers.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c88f32dd8248721a8a91410b9a6e4061773c742ece936ae933da417afb15257"}},{"ruleId":"D2","level":"warning","message":{"text":"_XMLFrameParser._iterparse_nodes (cognitive 95): _XMLFrameParser._iterparse_nodes has cognitive complexity 95 (threshold 15). Drivers by points: if/else 21 (57 pts), ternaries 5 (16 pts), loops 4 (14 pts), boolean chains 8 (nesting depth added 57). 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":"pandas/io/xml.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6eb62dc2bb8b075df404aca9491c76c953d7c70a18927eaa3f846e1724e984"}},{"ruleId":"D2","level":"warning","message":{"text":"_MergeOperation._maybe_coerce_merge_keys (cognitive 92): _MergeOperation._maybe_coerce_merge_keys has cognitive complexity 92 (threshold 15). Drivers by points: if/else 19 (53 pts), boolean chains 29, ternaries 3 (9 pts), loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec8698c25cb5b2113efb1148d6e66b18183e40fd0a01b494a48ea23f2ce2cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"HTMLFormatter._write_col_header (cognitive 89): HTMLFormatter._write_col_header has cognitive complexity 89 (threshold 15). Drivers by points: if/else 25 (72 pts), loops 4 (15 pts), boolean chains 2 (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":"pandas/io/formats/html.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1273fcf32620edd90b3959fa308489004a3564b2f38aed7921bbf38db78ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"cast.convert_dtypes (cognitive 88): cast.convert_dtypes has cognitive complexity 88 (threshold 15). Drivers by points: if/else 30 (65 pts), boolean chains 23 (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":"pandas/core/dtypes/cast.py"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"6726874d33c6d504709c2e1ca6b969707cfa1d541685a25fbf03cd1f0c531ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.fillna (cognitive 78): NDFrame.fillna has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (60 pts), loops 2 (8 pts), ternaries 2 (6 pts), boolean chains 4 (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":"pandas/core/generic.py"},"region":{"startLine":7277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e236127e754ee8eb46d659f121d4d5812d4253f0e5654109ec4705dc5e5df06"}},{"ruleId":"D2","level":"warning","message":{"text":"StringMethods._wrap_result (cognitive 77): StringMethods._wrap_result has cognitive complexity 77 (threshold 15). Drivers by points: if/else 27 (56 pts), ternaries 3 (13 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 41). 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":"pandas/core/strings/accessor.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"918e11ba6208703607cb12b714e2c6c8a342309808209404189d6ae348782778"}},{"ruleId":"D2","level":"warning","message":{"text":"Table._create_axes (cognitive 77): Table._create_axes has cognitive complexity 77 (threshold 15). Drivers by points: if/else 33 (54 pts), boolean chains 14, ternaries 2 (4 pts), error handling 1 (3 pts), loops 2 (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":"pandas/io/pytables.py"},"region":{"startLine":4821}}}],"partialFingerprints":{"codehealthFindingId/v1":"119b1dd9645fccfc15bde853997b3719aa4a49a5862886521facc9a099dc96c9"}},{"ruleId":"D2","level":"warning","message":{"text":"eval.eval (cognitive 75): eval.eval has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (48 pts), boolean chains 13, error handling 2 (7 pts), loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/computation/eval.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e700eff57735f9df866e4bae6055cdeafa53d3cb40992639494c9642eee3cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.replace (cognitive 74): NDFrame.replace has cognitive complexity 74 (threshold 15). Drivers by points: if/else 30 (61 pts), boolean chains 7, loops 1 (3 pts), ternaries 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":"pandas/core/generic.py"},"region":{"startLine":7733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5617b520ed953d05c61e46dd1f1574c3aefd88329221ca0c7eb8e24d7b175524"}},{"ruleId":"D2","level":"warning","message":{"text":"DatetimeArray._generate_range (cognitive 73): DatetimeArray._generate_range has cognitive complexity 73 (threshold 15). Drivers by points: if/else 29 (50 pts), boolean chains 10, ternaries 5 (10 pts), error handling 1 (3 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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f43ae16e0293d84e524cf4252a4acdd5e664db772c0b95896fa091c144e6da"}},{"ruleId":"D2","level":"warning","message":{"text":"grouper.get_grouper (cognitive 70): grouper.get_grouper has cognitive complexity 70 (threshold 15). Drivers by points: if/else 30 (58 pts), boolean chains 9, ternaries 1 (2 pts), loops 1 (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":"pandas/core/groupby/grouper.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f763cccd77c045cfea6218f217755230ddd3015bc8c51bb1ac9a70eafd5c21"}},{"ruleId":"D2","level":"warning","message":{"text":"stata._cast_to_stata_types (cognitive 70): stata._cast_to_stata_types has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (54 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"3067df48f923c7e06edac1596ce09d0076f572782fa46846854549128fa4a03c"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._box_pa_array (cognitive 69): ArrowExtensionArray._box_pa_array has cognitive complexity 69 (threshold 15). Drivers by points: if/else 24 (47 pts), boolean chains 13, error handling 3 (9 pts) (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9cbafb4a76a2106f209317815dd644f3c9f410fed39ce6559db5e9c715222d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame._reduce (cognitive 69): DataFrame._reduce has cognitive complexity 69 (threshold 15). Drivers by points: if/else 18 (51 pts), boolean chains 11, error handling 1 (4 pts), ternaries 2 (3 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":"pandas/core/frame.py"},"region":{"startLine":17063}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab910e2325fe6609128a4b06ae050e4359ccf2635c9aceb7ea5ea41045b5078"}},{"ruleId":"D2","level":"warning","message":{"text":"common.flex_binary_moment (cognitive 69): common.flex_binary_moment has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (47 pts), loops 4 (19 pts), boolean chains 3 (nesting depth added 46). 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":"pandas/core/window/common.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fe11b5c2e5f4ae1a816095907593f7901d11838abeb9690246dc297a83c63d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.from_records (cognitive 65): DataFrame.from_records has cognitive complexity 65 (threshold 15). Drivers by points: if/else 31 (51 pts), loops 2 (6 pts), error handling 2 (5 pts), boolean chains 3 (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":"pandas/core/frame.py"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6e63b84cd88675c3ebd4eb8249726ab3332e5456436e9ce2f5103aaf22c5ec"}},{"ruleId":"D2","level":"warning","message":{"text":"common.get_handle (cognitive 65): common.get_handle has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27 (48 pts), boolean chains 12, loops 2 (5 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":"pandas/io/common.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a13572d7d15a156b337353b25d8da72caaec81783457aab994a05ebfd1bdee9"}},{"ruleId":"D2","level":"warning","message":{"text":"HTMLFormatter._write_hierarchical_rows (cognitive 65): HTMLFormatter._write_hierarchical_rows has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 6 (17 pts), boolean chains 1 (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":"pandas/io/formats/html.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfead6cea4c77a023f54cc9ac44c3f58bc9d043b351c8664a8bd921af7fb71d"}},{"ruleId":"D2","level":"warning","message":{"text":"numeric._coerce_to_data_and_mask (cognitive 64): numeric._coerce_to_data_and_mask has cognitive complexity 64 (threshold 15). Drivers by points: if/else 34 (57 pts), boolean chains 7 (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":"pandas/core/arrays/numeric.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb45282b11386a074898bdecf934b6cb990c667272a39cb751b5bede4d948d03"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.__init__ (cognitive 64): DataFrame.__init__ has cognitive complexity 64 (threshold 15). Drivers by points: if/else 30 (50 pts), ternaries 4 (9 pts), boolean chains 5 (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":"pandas/core/frame.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbdd161596d0e864e2c6ac9083a30e56bcdd27ed817c558e0b3238685d07f00"}},{"ruleId":"D2","level":"warning","message":{"text":"numeric.to_numeric (cognitive 64): numeric.to_numeric has cognitive complexity 64 (threshold 15). Drivers by points: if/else 27 (44 pts), boolean chains 13, 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":"pandas/core/tools/numeric.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a0aba944521818e90ac3dd34dc2ef710b7054d43ac6f78866e9383d43a136d"}},{"ruleId":"D2","level":"warning","message":{"text":"PlotAccessor.__call__ (cognitive 64): PlotAccessor.__call__ has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (41 pts), boolean chains 12, error handling 1 (5 pts), loops 1 (3 pts), ternaries 1 (3 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":"pandas/plotting/_core.py"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d38038ec02ea39edf4410b17da9553a0bd93d7704184625f02b5ab07176389"}},{"ruleId":"D2","level":"warning","message":{"text":"Series.__init__ (cognitive 63): Series.__init__ has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (54 pts), boolean chains 7, ternaries 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":"pandas/core/series.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f191f7dd8f03908e25192afc17c649d61c3385fe51bff06e73d3df6814bc96"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.join (cognitive 61): Index.join has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 17, ternaries 4 (12 pts), error handling 3 (8 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0db3cf794fb3f854fd344793bb0e9ad8a9ad80130814e9cc3b80003ddf6b38d"}},{"ruleId":"D2","level":"warning","message":{"text":"construction.ndarray_to_mgr (cognitive 61): construction.ndarray_to_mgr has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (42 pts), boolean chains 13, ternaries 2 (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":"pandas/core/internals/construction.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5476f6d200a6eb509dbb7aa3581e5c092481d793d28a389f7a7ca9d82b587b"}},{"ruleId":"D2","level":"warning","message":{"text":"pivot.__internal_pivot_table (cognitive 60): pivot.__internal_pivot_table has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (38 pts), boolean chains 8, loops 4 (8 pts), error handling 2 (6 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":"pandas/core/reshape/pivot.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fcb8d1b28c30b5ae977580ce723884385a700b272e5e7d7a698f9762173eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"TextFileReader._clean_options (cognitive 60): TextFileReader._clean_options has cognitive complexity 60 (threshold 15). Drivers by points: if/else 28 (43 pts), boolean chains 8, loops 3 (6 pts), error handling 1 (2 pts), 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":"pandas/io/parsers/readers.py"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5f70bc89db33051b684089c0aa9d5e84bd2083bd262223bb38f442e7cdeb9d"}},{"ruleId":"D2","level":"warning","message":{"text":"asserters.assert_series_equal (cognitive 59): asserters.assert_series_equal has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 16, ternaries 6 (14 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":"pandas/_testing/asserters.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f20e1a9b8741ee86807e16b87bf31be4b31b45a2016b92c6eca42210f431c0"}},{"ruleId":"D2","level":"warning","message":{"text":"construction.array (cognitive 59): construction.array has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25 (45 pts), boolean chains 11, error handling 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":"pandas/core/construction.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f161da42d42a383b6fac0d18ba87db79082729ff3b1fe0294e5730be4b68838"}},{"ruleId":"D2","level":"warning","message":{"text":"WrappedCythonOp._call_cython_op (cognitive 59): WrappedCythonOp._call_cython_op has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (51 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/ops.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"713ce88457c612fc6a1159973ba363c09f5cf1a8c7023cd10b20fe549f4c0276"}},{"ruleId":"D2","level":"warning","message":{"text":"_MergeOperation._get_merge_keys (cognitive 59): _MergeOperation._get_merge_keys has cognitive complexity 59 (threshold 15). Drivers by points: if/else 22 (51 pts), loops 3 (6 pts), boolean chains 2 (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":"pandas/core/reshape/merge.py"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dd5989284db808a3a28912fcfcc8d2c5eba3e474a3e37952bd8d46b2d1d8fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._evaluate_op_method (cognitive 58): ArrowExtensionArray._evaluate_op_method has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 15, error handling 4 (7 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb07d2e9ec9fa5786e82983978f172a4e364e32c6c6316c461c06f82beba8bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"concat._make_concat_multiindex (cognitive 58): concat._make_concat_multiindex has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 7, loops 3 (7 pts), ternaries 1 (5 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":"pandas/core/reshape/concat.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b79560bcc9bf5cba43aa5cd9af57ff774f0be75280848763feaab5ec7a600de"}},{"ruleId":"D2","level":"warning","message":{"text":"_util._post_convert_dtypes (cognitive 58): _util._post_convert_dtypes has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 4 (10 pts), boolean chains 7, error handling 1 (2 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":"pandas/io/_util.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ffa7f679a1d43fbd3aa70210a3178d7b2eb65755f51ce7002bda12ea690b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"StataReader.read (cognitive 57): StataReader.read has cognitive complexity 57 (threshold 15). Drivers by points: if/else 32 (47 pts), loops 5 (8 pts), boolean chains 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":"pandas/io/stata.py"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"070fb2944a02295fb3580e3083b9949d13d1d6fadd680b590b87fc4c9c5fbce3"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseExcelReader._parse_sheet (cognitive 56): BaseExcelReader._parse_sheet has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 4 (12 pts), boolean chains 6, error handling 2 (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":"pandas/io/excel/_base.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1381499a075c08a28c20360a7b45f256825fef14e96d019ef33718d10ddd6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowParserWrapper._get_pyarrow_options (cognitive 56): ArrowParserWrapper._get_pyarrow_options has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 10, loops 2 (4 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":"pandas/io/parsers/arrow_parser_wrapper.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7409952cac33631b8e5dc1a834a699818ced7e53e46fc28749972a2da11351a3"}},{"ruleId":"D2","level":"warning","message":{"text":"melt.melt (cognitive 54): melt.melt has cognitive complexity 54 (threshold 15). Drivers by points: if/else 30 (46 pts), boolean chains 3, ternaries 1 (3 pts), loops 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":"pandas/core/reshape/melt.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"90582f337b81b7d8ec74b524c59b42eeb6952089dd86a03fbee07c63f1883c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes._assemble_from_unit_mappings (cognitive 54): datetimes._assemble_from_unit_mappings has cognitive complexity 54 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 7, error handling 2 (5 pts), loops 4 (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":"pandas/core/tools/datetimes.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"409c2cfac615e0e278cc2e85f5fc5e26176f9b15d7a8d03ae9ffb05d06af65e5"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._get_lines (cognitive 54): PythonParser._get_lines has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 2 (8 pts), ternaries 1 (4 pts), error handling 1 (3 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4dc488bf662ec82a2e9949fcf76cb12663b9dee2965cfa2056e1760ed58cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._align_series (cognitive 53): _iLocIndexer._align_series has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (42 pts), boolean chains 9, loops 1 (2 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":"pandas/core/indexing.py"},"region":{"startLine":3236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5709c02b1fcdb2d1ad041a1d02d26a24e3f35b5448de3539cd86502bf4ccc95"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseBlockManager._slice_take_blocks_ax0 (cognitive 53): BaseBlockManager._slice_take_blocks_ax0 has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 5 (17 pts), boolean chains 5 (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":"pandas/core/internals/managers.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98242a767168a471d7ac6364b8cea95f208e22ee1590460a444ca9630fea187"}},{"ruleId":"D2","level":"warning","message":{"text":"merge._factorize_keys (cognitive 52): merge._factorize_keys has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 10, ternaries 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":2873}}}],"partialFingerprints":{"codehealthFindingId/v1":"da66bf52069557519e0d9c48e74e2f0c469d77e27d3468a456ce9a6737052265"}},{"ruleId":"D2","level":"warning","message":{"text":"_json.to_json (cognitive 51): _json.to_json has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 7, loops 1 (4 pts), ternaries 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":"pandas/io/json/_json.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cb12b2880e58df967bd6ee5c58522188ef2742ab2b1d5ece13e1dfd846e1ae"}},{"ruleId":"D2","level":"warning","message":{"text":"api.union_indexes (cognitive 50): api.union_indexes has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (40 pts), ternaries 2 (5 pts), loops 2 (4 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":"pandas/core/indexes/api.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1038973c3b155457030c319ed3d1afdd8a4d6cf40420d14b17542d4af67f39ca"}},{"ruleId":"D2","level":"warning","message":{"text":"tools.handle_shared_axes (cognitive 50): tools.handle_shared_axes has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 4 (13 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/tools.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc41706a82a3f43e0a646059976e620f6e472e2ac119a22782505d903f373c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Categorical.__init__ (cognitive 49): Categorical.__init__ has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (42 pts), boolean chains 4, error handling 1 (3 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":"pandas/core/arrays/categorical.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"737a17dd5ca333d37e17a34e0275a85b69040e4b807b4b5cce0eeb812c059703"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowParserWrapper._finalize_index (cognitive 49): ArrowParserWrapper._finalize_index has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (33 pts), ternaries 2 (7 pts), loops 2 (5 pts), boolean chains 4 (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":"pandas/io/parsers/arrow_parser_wrapper.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7a5b3ff599658f78a8fdb1048f0a7bb5c193f6aa5a9e80b0eeb86ec3b4c9d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserBase._infer_types (cognitive 49): ParserBase._infer_types has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 6, error handling 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":"pandas/io/parsers/base_parser.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4338fd70105abe4a6a6bed8c3ce2c3824573e7689d1d0d77cabf6c31f8e63024"}},{"ruleId":"D2","level":"warning","message":{"text":"interval.interval_range (cognitive 48): interval.interval_range has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 5, ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/interval.py"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cc1addb31c928c68e814ff7ddf318e2862301ae54766dc6a08b03dbf6fc66e"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes._to_datetime_with_unit (cognitive 48): datetimes._to_datetime_with_unit has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (41 pts), error handling 2 (5 pts), ternaries 1 (2 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":"pandas/core/tools/datetimes.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"2089766e8b3d76d06cf763e88c9d6a70170a7bb04e7b79a5f8530481cccc5617"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._rows_to_cols (cognitive 48): PythonParser._rows_to_cols has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"92539ef2c6190ab2844c5b8aef610b37cc44e5cb13d9c6e4b735f2fb2c29d34e"}},{"ruleId":"D2","level":"warning","message":{"text":"readers._can_parallelize_csv (cognitive 48): readers._can_parallelize_csv has cognitive complexity 48 (threshold 15). Drivers by points: if/else 29 (32 pts), boolean chains 8, error handling 3 (5 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/readers.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b899a9e73f4506a36b40a8215500413ac4325189da3dfe414875f0627f368ae"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseArray.__init__ (cognitive 47): SparseArray.__init__ has cognitive complexity 47 (threshold 15). Drivers by points: if/else 26 (39 pts), boolean chains 3, error handling 2 (3 pts), 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4fc925271addb1238c2b048da03245cf1659ece6da4c36d1fc25c32a3dc8e4"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame._reduce_axis1 (cognitive 47): DataFrame._reduce_axis1 has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 6, loops 2 (4 pts), ternaries 2 (4 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":"pandas/core/frame.py"},"region":{"startLine":17244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78c9db031e6182902c92fc6e1b6dd0b763f0f2fe81da640bd4f2fb02b161fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"to_dict.to_dict (cognitive 47): to_dict.to_dict has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 6 (13 pts), loops 2 (9 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/methods/to_dict.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"baac91f4c4525f4dc898b6fae8da7d499d0bd66e6d061bc19a386e79a9febbdf"}},{"ruleId":"D2","level":"warning","message":{"text":"algorithms.isin (cognitive 46): algorithms.isin has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 13 (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":"pandas/core/algorithms.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eef8e70f307470b73107431d271e6c07ec5e1cc562912d3c87382162482fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"construction.dict_to_mgr (cognitive 46): construction.dict_to_mgr has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 4 (10 pts), boolean chains 6, loops 2 (5 pts), error handling 1 (3 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":"pandas/core/internals/construction.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"07736a94d2f21a57f8ff368eb15c2868e9c91382db4ead126767a476cc63f6cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ExcelFormatter._format_hierarchical_rows (cognitive 46): ExcelFormatter._format_hierarchical_rows has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 5 (17 pts), boolean chains 4 (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":"pandas/io/formats/excel.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ad2d203fe3d9ac9c413e8c397bb521eda3dc4781e6464d1d1a6c8c9c3222d4"}},{"ruleId":"D2","level":"warning","message":{"text":"_table_schema.parse_table_schema (cognitive 46): _table_schema.parse_table_schema has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 2 (7 pts), boolean chains 5, loops 3 (4 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":"pandas/io/json/_table_schema.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c846170d71b67cfadabbdbae3b0623f1daf8e86e14c9cfa7774f0bae122f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"HDFStore._create_storer (cognitive 46): HDFStore._create_storer has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (41 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa3a3c5ed1b4a0330c24796175aa8befa3f688ebd4a5ca924c7421f6b65ee0e"}},{"ruleId":"D2","level":"warning","message":{"text":"min_max_.sliding_min_max (cognitive 45): min_max_.sliding_min_max has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 6 (15 pts), boolean chains 9, ternaries 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/_numba/kernels/min_max_.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d71934d8a295664067dfc16ca2bb06100023d0670ffe2464285d01d180ed1f"}},{"ruleId":"D2","level":"warning","message":{"text":"algorithms.safe_sort (cognitive 45): algorithms.safe_sort has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (33 pts), boolean chains 8, error handling 1 (2 pts), 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":"pandas/core/algorithms.py"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b84bfa277c557b5817056be085d8988519a51f0b8dd8bd504514e61d60e92f"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeIndex._concat (cognitive 45): RangeIndex._concat has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 4, loops 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":"pandas/core/indexes/range.py"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c67a39e3d1b5699a784c7c25a2099f1a948603c70a481398de4dff0a49e6ba"}},{"ruleId":"D2","level":"warning","message":{"text":"arraylike.array_ufunc (cognitive 44): arraylike.array_ufunc has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 3 (8 pts), ternaries 3 (8 pts), boolean chains 7 (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":"pandas/core/arraylike.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"509cac15290d8562a1cdb19d39310b6a1b28fa9acb109083bbe8f8520d3ceb68"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseArray.__getitem__ (cognitive 44): SparseArray.__getitem__ has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (36 pts), ternaries 2 (6 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a6434b814c7f90c20844ff22fd63992abe7dda597b214a5041f94f0910b678"}},{"ruleId":"D2","level":"warning","message":{"text":"construction.sanitize_array (cognitive 44): construction.sanitize_array has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 9 (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":"pandas/core/construction.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc33c506d1663120633f8550d6392d8ba1ed4b5fb583579d5fd2389223bbd7"}},{"ruleId":"D2","level":"warning","message":{"text":"cast._maybe_promote (cognitive 44): cast._maybe_promote has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (37 pts), error handling 2 (5 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2f4d9542cd888b39645fe1a218bf0f767b54e53845912449e237cf610dc0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"construction.to_arrays (cognitive 44): construction.to_arrays has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 5, loops 1 (5 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":"pandas/core/internals/construction.py"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd7f6f0f45c581acf76266022c1cd4188311085b840105d1e1ca7eefdb51725"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes.to_datetime (cognitive 44): datetimes.to_datetime has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 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":"pandas/core/tools/datetimes.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"31277c90304d89bf8251749aa62721dfab1e8f300dfe92562c46c6061c084f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"parquet._get_path_or_handle (cognitive 44): parquet._get_path_or_handle has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (27 pts), error handling 3 (9 pts), boolean chains 8 (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":"pandas/io/parquet.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c97258f3dff3f291c44ba618875307a88912b410da9835ed52940859cb7e2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"asserters.assert_index_equal (cognitive 43): asserters.assert_index_equal has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (26 pts), error handling 2 (6 pts), boolean chains 5, ternaries 2 (4 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":"pandas/_testing/asserters.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a5b5bfe60a098c0cbdba4a3550e235a1ba1bde8bf64f3701b685d246df275f"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex._get_level_indexer (cognitive 43): MultiIndex._get_level_indexer has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (2 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":"pandas/core/indexes/multi.py"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7f6194e3fa286a022e52ea4e2dfdbc3454c71caca44a372e1309825e37423a"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocIndexer._getitem_axis (cognitive 43): _LocIndexer._getitem_axis has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (29 pts), error handling 1 (6 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexing.py"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"facdb9cec40d13cc4e5bff4b983bdc188366dde042db394cd42697dfab9e1197"}},{"ruleId":"D2","level":"warning","message":{"text":"_MergeOperation._validate_left_right_on (cognitive 43): _MergeOperation._validate_left_right_on has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 8 (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":"pandas/core/reshape/merge.py"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a714a4118a585c46204ac4c85f296782acaae7dea12eb043d8ca61ede23ad42f"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenpyxlWriter._write_cells_normal (cognitive 43): OpenpyxlWriter._write_cells_normal has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (19 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/excel/_openpyxl.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5070bec97e182a855e0c0af8d1dea2663602f28dcce534d30d8adbe9e3c2ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.reset_index (cognitive 42): DataFrame.reset_index has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (33 pts), ternaries 2 (6 pts), loops 1 (2 pts), boolean chains 1 (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":"pandas/core/frame.py"},"region":{"startLine":8065}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e26dca4277c11e75aa2be8763a0e8881e3b6569ce524a98bc056f1dab22fe09"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.__new__ (cognitive 42): Index.__new__ has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 6, error handling 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":"pandas/core/indexes/base.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bbf3fd7f6cd548a5f4b9d2da349217edb1f6167111120c8207456f7665f316"}},{"ruleId":"D2","level":"warning","message":{"text":"base.get_values_for_csv (cognitive 42): base.get_values_for_csv has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 6, loops 1 (2 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":"pandas/core/indexes/base.py"},"region":{"startLine":8654}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c167247c6926bfd7058618d758103b829e029794451f4edfe9962480ebceef0"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocIndexer._convert_to_indexer (cognitive 42): _LocIndexer._convert_to_indexer has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (29 pts), error handling 4 (8 pts), boolean chains 5 (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":"pandas/core/indexing.py"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"154700cfbf2ef3c2b047e8db818e03adca9b7015f4e0455155846e861b07e8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._try_convert_data (cognitive 42): Parser._try_convert_data has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (21 pts), error handling 5 (12 pts), boolean chains 6, ternaries 1 (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":"pandas/io/json/_json.py"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bdd3e84bf64a9bbbb49c99b3d39e31cec4387fc395d22e92f59ee325dc1c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._next_line (cognitive 42): PythonParser._next_line has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 4 (8 pts), boolean chains 3, error handling 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18259726608f994d16bf54e1db88b22beee9296029b63856eafadc0101041f4"}},{"ruleId":"D2","level":"warning","message":{"text":"apply.reconstruct_func (cognitive 41): apply.reconstruct_func has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 8, loops 2 (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":"pandas/core/apply.py"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdf888c7964d0ffe77a07de6519c70d2ee823ed1b21263e632e6a1793ca568c"}},{"ruleId":"D2","level":"warning","message":{"text":"timedeltas.sequence_to_td64ns (cognitive 41): timedeltas.sequence_to_td64ns has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 4, error handling 2 (4 pts), ternaries 1 (2 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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afabd7f7b5e14e8841bef3191ec9af04732298c58be51b6ac703eb0ff8c4960"}},{"ruleId":"D2","level":"warning","message":{"text":"cast.maybe_downcast_numeric (cognitive 41): cast.maybe_downcast_numeric has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 6, error handling 1 (3 pts) (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":"pandas/core/dtypes/cast.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0847ef8359ddabc36760fbf7a314dc0fcd4828e8a20092795d1a3cde2fb3cfda"}},{"ruleId":"D2","level":"warning","message":{"text":"_AsOfMerge._validate_left_right_on (cognitive 41): _AsOfMerge._validate_left_right_on has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 8, ternaries 2 (6 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":"pandas/core/reshape/merge.py"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"115a68a15634b997557a2209963a45e1689e98d0562d825768cefac9bb4630d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._from_sequence_of_strings (cognitive 40): ArrowExtensionArray._from_sequence_of_strings has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 3, error handling 1 (3 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"acef8e8e1ce137310e491621cad23b1e38a423b88b9b94a2df25baaa8a5b2b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes._generate_range (cognitive 40): datetimes._generate_range has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (31 pts), loops 2 (4 pts), boolean chains 3, ternaries 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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"568eab045a0ec2094f01b1e61610b488f382f9f3f1844364517863147922f345"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.join (cognitive 40): DataFrame.join has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 3 (8 pts), loops 1 (2 pts), boolean chains 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":"pandas/core/frame.py"},"region":{"startLine":15764}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c46acc19d64f10e0ad43d32579c7625adb89d4619a587d39e80377e3d267917"}},{"ruleId":"D2","level":"warning","message":{"text":"DatetimeIndexOpsMixin.equals (cognitive 40): DatetimeIndexOpsMixin.equals has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), error handling 4 (14 pts), boolean chains 4 (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":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0851b87100ef9ab06c085b2514afd51d8ba7be1f835103b90be69523d03ef932"}},{"ruleId":"D2","level":"warning","message":{"text":"printing.format_object_summary (cognitive 40): printing.format_object_summary has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/printing.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cd3ae9d0dfb2029cb99cd5ecf020145da99ea2180c57520d2ec119fc2f3d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._try_convert_to_date (cognitive 40): Parser._try_convert_to_date has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (19 pts), error handling 4 (10 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (2 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":"pandas/io/json/_json.py"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc1b36e09e1c6440da685a5262c187f349ed956c34a83605922c009b4d3ed99"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._convert_to_ndarrays (cognitive 40): PythonParser._convert_to_ndarrays has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 5, error handling 1 (3 pts), ternaries 1 (2 pts), 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11e13fb6dba5e00b9b326337cbc2767f15b8445e7c76795b130265f832cedca"}},{"ruleId":"D2","level":"warning","message":{"text":"BarPlot._make_plot (cognitive 40): BarPlot._make_plot has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4 (10 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec38437a20e4c11d9917795cabfbdd848d53c0eaaecc91d75068925985a7fef"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.shift (cognitive 39): DataFrame.shift has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 3 (10 pts), boolean chains 4, ternaries 1 (3 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":"pandas/core/frame.py"},"region":{"startLine":7511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00eb3c63e94424505f75ca3af16f5cfba7f1df279df53a64994dd1f52f177ba"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockManager.iset (cognitive 39): BlockManager.iset has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 4, 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":"pandas/core/internals/managers.py"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9ade802407062886b0f88301ea5987585178e7e5d141512669513377a60dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"common._get_filepath_or_buffer (cognitive 39): common._get_filepath_or_buffer has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 11, error handling 2 (4 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":"pandas/io/common.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec2653ce886904fb5a9c7af4e018783b009f625b2f1c5f91679f542996d2612"}},{"ruleId":"D2","level":"warning","message":{"text":"_HtmlFrameParser._expand_colspan_rowspan (cognitive 39): _HtmlFrameParser._expand_colspan_rowspan has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 7 (16 pts), boolean chains 3, 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":"pandas/io/html.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a4819127471cb786721f2222778f0cb2ed5d2199b2a4a3525aca127e1d95c4"}},{"ruleId":"D2","level":"warning","message":{"text":"AppendableFrameTable.read (cognitive 39): AppendableFrameTable.read has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts), ternaries 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":"pandas/io/pytables.py"},"region":{"startLine":5714}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1d460d0496004557877a7d06b98847e4a3ae2404c17d14962a7453397b75e0"}},{"ruleId":"D2","level":"warning","message":{"text":"tools.create_subplots (cognitive 39): tools.create_subplots has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/tools.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcb05c556f41255a985edefcd45075d9c5c3dd832295be4b37f2b8fba4eaa0e"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeIndex._union (cognitive 38): RangeIndex._union has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (31 pts), boolean chains 7 (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":"pandas/core/indexes/range.py"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"c919fa2e1c50cc4d0568e558252e1dbd9b7b4af03fddbdc4bd6f7b6f1dbfacb9"}},{"ruleId":"D2","level":"warning","message":{"text":"concat.concat (cognitive 38): concat.concat has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 4 (9 pts), boolean chains 7 (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":"pandas/core/reshape/concat.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"991794a228b7d1d3ab110af4dc7863b5d24307002797cd7eea6f02965225d250"}},{"ruleId":"D2","level":"warning","message":{"text":"merge.get_join_indexers (cognitive 38): merge.get_join_indexers has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 11 (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":"pandas/core/reshape/merge.py"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc46f3094ba1cb929b30792815036b3a9300fd499b2a267c07e36f7912f31560"}},{"ruleId":"D2","level":"warning","message":{"text":"Styler.to_latex (cognitive 38): Styler.to_latex has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 6 (14 pts), boolean chains 4, loops 2 (4 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":"pandas/io/formats/style.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b900f819b41928f72360b19dbe6f0d35f4c0fd9769819a3d429c7808f699633"}},{"ruleId":"D2","level":"warning","message":{"text":"StylerRenderer._translate_latex (cognitive 38): StylerRenderer._translate_latex has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (6 pts), ternaries 2 (5 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":"pandas/io/formats/style_render.py"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea226221aabe08d7e2eaf945252361546a854dabaad91ea2e533c56cd1cf2ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserBase._agg_index (cognitive 38): ParserBase._agg_index has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 5, ternaries 1 (3 pts), 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":"pandas/io/parsers/base_parser.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b725d41f419570e09498ef1b2dfd2ba7b809f8b317b658ac89fd0a8325de713c"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._reduce_pyarrow (cognitive 37): ArrowExtensionArray._reduce_pyarrow has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 14, error handling 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe8951b39f6839aadc460be07917311cae9e959772391ce3ba2da0116ca7983"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.asof (cognitive 37): NDFrame.asof has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (29 pts), ternaries 3 (4 pts), loops 1 (3 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":"pandas/core/generic.py"},"region":{"startLine":8476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b6bd622ef6f130768dffb531859b20f0d4517d2682c0260e4fa5790e9685fd"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes._convert_listlike_datetimes (cognitive 37): datetimes._convert_listlike_datetimes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 2, error handling 2, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/tools/datetimes.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe4aac9dfcc05df3db29e679ec7060cdc175f44b65812dba6599aff2cb6dbea"}},{"ruleId":"D2","level":"warning","message":{"text":"_normalize.json_normalize (cognitive 37): _normalize.json_normalize has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/json/_normalize.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"be702dd7ae08de859d0635d2004b17c65f0befee51a0fa9d77e5c5b57fd7ad12"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._cast_pointwise_result (cognitive 36): ArrowExtensionArray._cast_pointwise_result has cognitive complexity 36 (threshold 15). Drivers by points: error handling 7 (15 pts), if/else 9 (13 pts), boolean chains 8 (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9b92af367939535d31c9c8995fc19b8af68badcb947e411ccdadf7348049a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._groupby_op_pyarrow (cognitive 36): ArrowExtensionArray._groupby_op_pyarrow has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 9, error handling 2 (5 pts) (nesting depth added 7). 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":3900}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02d9cbd38451a3bfccedbea617a39c13bd4dbe1b5beafa546a31ce35202049f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.set_index (cognitive 36): DataFrame.set_index has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (29 pts), error handling 1 (3 pts), loops 3, 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. This shape REPEATS in the file: one other method here (DataFrame.set_index) 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":"pandas/core/frame.py"},"region":{"startLine":7753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e10ef70c3d5b489ebe1605fc6201d6c91c3a4372454235aca07f8479c330da"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.set_index (cognitive 36): DataFrame.set_index has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (29 pts), error handling 1 (3 pts), loops 3, 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. This shape REPEATS in the file: one other method here (DataFrame.set_index) 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":"pandas/core/frame.py"},"region":{"startLine":7763}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a2d1ebf540523c1bfef86da16867ddf4f6111ac02f2f5375bd7f65060b653a"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame._rename (cognitive 36): NDFrame._rename has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 6, loops 1, ternaries 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. This shape REPEATS in the file: one other method here (NDFrame._rename) 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":"pandas/core/generic.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1f103dc53b4db400d83b47ac805804f8b424a18c26cf16ddd217e144b6e878"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame._rename (cognitive 36): NDFrame._rename has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 6, loops 1, ternaries 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. This shape REPEATS in the file: one other method here (NDFrame._rename) 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":"pandas/core/generic.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb86bbbef0c7fb49a0bd9128b9fe3839a6bbd7bf6e1fff7b461ce6d22dada7f9"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.to_latex (cognitive 36): NDFrame.to_latex has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (24 pts), ternaries 6, boolean chains 4, loops 1 (2 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":"pandas/core/generic.py"},"region":{"startLine":3455}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcce38fbfdfe3e7fa9f495d5a6c49e78deed56155c86d663ae39372f87ac0f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Block.replace_list (cognitive 36): Block.replace_list has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (8 pts), boolean chains 7 (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":"pandas/core/internals/blocks.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f242fd0ff4826d8ab55caefa40be00dac88b8c015d2c90cdf783803195075e1"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeGrouper.__init__ (cognitive 36): TimeGrouper.__init__ has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 5, error handling 2 (3 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":"pandas/core/resample.py"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b05a52832d9e17288e714fbd8c31633ed4aca4752ee1f3f8b1ca8c6e412a11"}},{"ruleId":"D2","level":"warning","message":{"text":"encoding._get_dummies_1d (cognitive 36): encoding._get_dummies_1d has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 4, loops 2 (4 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":"pandas/core/reshape/encoding.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebcafeac250532068903d6cb8298cd682c47eb2895643276e4fd2b8d9bc9530"}},{"ruleId":"D2","level":"warning","message":{"text":"sorting.lexsort_indexer (cognitive 36): sorting.lexsort_indexer has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/sorting.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a264606e3a6d5108510ef3cd7962e584cc2a92dc7a990c901a8a295e11789d"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes._adjust_to_origin (cognitive 36): datetimes._adjust_to_origin has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 4 (8 pts), boolean chains 4 (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":"pandas/core/tools/datetimes.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a567280aa63f9430dfaa09140715a3477e55c5c37967b2332a556888d5d446e0"}},{"ruleId":"D2","level":"warning","message":{"text":"html._data_to_frame (cognitive 36): html._data_to_frame has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 1 (6 pts), boolean chains 1 (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":"pandas/io/html.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68b5f7c74065a4b02381c32f4dd055682dc14dfc5bf8b8b9b6520ad26db586d"}},{"ruleId":"D2","level":"warning","message":{"text":"MPLPlot._adorn_subplots (cognitive 36): MPLPlot._adorn_subplots has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (31 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df4e959dee630abd0502284254547d3dfdfc0ededefdab23c8aebebe0131892"}},{"ruleId":"D2","level":"warning","message":{"text":"DatetimeLikeArrayMixin._validate_listlike (cognitive 35): DatetimeLikeArrayMixin._validate_listlike has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 9, error handling 1 (2 pts), ternaries 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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a79468e664a1dc3548fd2ed1fd0252b64ab2c2617c33b14874c570a06eb1b3"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame._align_for_op (cognitive 35): DataFrame._align_for_op has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 5, 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":"pandas/core/frame.py"},"region":{"startLine":10396}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c9cf46efc9b496c87cdae818a82b65606fe5ced4049804119aa69561219048"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.filter (cognitive 35): NDFrame.filter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (26 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":5675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3807f56be4f38ea4d32110adba942a561f5d3d128f9699f64eaab5507c2084d"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._setitem_with_indexer_missing (cognitive 35): _iLocIndexer._setitem_with_indexer_missing has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (35 pts) (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":"pandas/core/indexing.py"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6642a1c27d98ebbca055fe120e83ca88885c14633d763f085f7bb2699800d7"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.to_numpy_dtype_inference (cognitive 34): _utils.to_numpy_dtype_inference has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 3, error handling 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":"pandas/core/arrays/_utils.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b79839c9a1e5e98c1ad7acc2f97ea91fd28be8b41c161b0c8ae7c516b25d80"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._cmp_method (cognitive 34): ArrowExtensionArray._cmp_method has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (15 pts), error handling 4 (12 pts), boolean chains 7 (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b32799ddaaaa848518c5df6ce4642072fa59073963122a27c2521b88f630db0"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.apply (cognitive 34): DataFrame.apply has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (30 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":15261}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe95f384993af0084300b891ab1cbddc3bfcebb60f6a7e579997d6fe67897960"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.clip (cognitive 34): NDFrame.clip has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 7, 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":"pandas/core/generic.py"},"region":{"startLine":8998}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeec16b0469b1cc161382625f51ccec9bfb97803b15171400c720eec9ab0e25"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes.date_range (cognitive 34): datetimes.date_range has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71b1289e296210555088634ec32527c2245c209c116de2273bc1788a8867f40"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._align_frame (cognitive 34): _iLocIndexer._align_frame has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 6, 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":"pandas/core/indexing.py"},"region":{"startLine":3352}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2b6cfb6883e458e181c6c6a70731d017ad42b5c978b3c25e501ce263ed559b"}},{"ruleId":"D2","level":"warning","message":{"text":"select.select (cognitive 34): select.select has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (6 pts), boolean chains 3 (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":"pandas/core/methods/select.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dab958b3088eb08c95a4185dae8e880b4ac5c61af4fb51d95c7ef054103031"}},{"ruleId":"D2","level":"warning","message":{"text":"Table.create_index (cognitive 34): Table.create_index has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (30 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":"pandas/io/pytables.py"},"region":{"startLine":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a2158e8a4b151055840dc6defd948054bfeb87b400889910c4761c3ebeb31b"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseMaskedArray._arith_method (cognitive 33): BaseMaskedArray._arith_method has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 6 (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":"pandas/core/arrays/masked.py"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b27242aefe2ca582eb4c84b7c0126e0a44610cb3120a5c1fc4d17a384ef8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"StringArray._cmp_method (cognitive 33): StringArray._cmp_method has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 6 (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":"pandas/core/arrays/string_.py"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb456883cb95da2ff309d0c54429eab6ed2aa243f562d6396873bfd73f8f654"}},{"ruleId":"D2","level":"warning","message":{"text":"TimedeltaArray.__mul__ (cognitive 33): TimedeltaArray.__mul__ 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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3e85d75e442f656bee07f4aa51b2ac4bc13b807f58adcddcd9d56acf75b46c"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalDtype.__init__ (cognitive 33): IntervalDtype.__init__ has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 18). 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":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"253423b278e5a31e1717a584eb0f64148e02d91790e28646122481ee327cfbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupBy._value_counts (cognitive 33): GroupBy._value_counts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (26 pts), ternaries 3 (5 pts), boolean chains 1, 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dea619d4b99e512b10c30e8bde8af82b40021d14ab24752e7cc0f23ecb90cf"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseBlockManager.setitem (cognitive 33): BaseBlockManager.setitem has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 6, ternaries 1 (5 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aa061c993c45e6dd9cd832da6998591c3e9eee01cbb56988d6550b8dfc0a57"}},{"ruleId":"D2","level":"warning","message":{"text":"style_render._get_level_lengths (cognitive 33): style_render._get_level_lengths has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style_render.py"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eed604bc003eb58d907aac457494cd24a3735d517e05e553e10cff5815808ad"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame._set_item_frame_value (cognitive 32): DataFrame._set_item_frame_value has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, loops 1 (4 pts), 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":"pandas/core/frame.py"},"region":{"startLine":4815}}}],"partialFingerprints":{"codehealthFindingId/v1":"383193dc80ce82c61c1a85f2a72d736c405bd3ee4ad860cc330a29f7b958507e"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.__setstate__ (cognitive 32): NDFrame.__setstate__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (6 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":"pandas/core/generic.py"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae3f0573b300250f73b76dde8cbb0b9fc2c93e59d3dc78642419dedc72a539"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.xs (cognitive 32): NDFrame.xs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (30 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":"pandas/core/generic.py"},"region":{"startLine":4194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cc88b33daab1cd205a59b2f9e002a1c7e46af23419089fc8cbe1215f87e78b"}},{"ruleId":"D2","level":"warning","message":{"text":"CParserWrapper._read_arrays (cognitive 32): CParserWrapper._read_arrays has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 1 (4 pts), loops 1 (2 pts), boolean chains 1, error handling 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":"pandas/io/parsers/c_parser_wrapper.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabc764638d9101587291a64a60e1adcb87f6c1e40cf8a1430ca3fb61e7d24cf"}},{"ruleId":"D2","level":"warning","message":{"text":"readers.read_fwf (cognitive 32): readers.read_fwf has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, loops 2 (3 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":"pandas/io/parsers/readers.py"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e915b02ca6147797ed7013e8aca9e968cc07a1d909c6a0e905b624fec210f73"}},{"ruleId":"D2","level":"warning","message":{"text":"StataReader._do_convert_missing (cognitive 32): StataReader._do_convert_missing has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (6 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":"pandas/io/stata.py"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07b86f299e2fa45c24da1c05f83bc053f1068066076502d2c3e431eea6e3bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"StataReader._do_convert_categoricals (cognitive 32): StataReader._do_convert_categoricals has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (5 pts), error handling 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":"pandas/io/stata.py"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0ab0e45fc4f0207a8d58908597d3bcfb217f4d2ed6ebab2fb861bed1954ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"_XMLFrameParser._parse_nodes (cognitive 32): _XMLFrameParser._parse_nodes has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 10 (21 pts), if/else 6 (7 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":"pandas/io/xml.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b88f45570d3de2a06b3e9d4416b63074dfc4d8e195c55dd9134675f7cdc867"}},{"ruleId":"D2","level":"warning","message":{"text":"MPLPlot.__init__ (cognitive 32): MPLPlot.__init__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 5, ternaries 1 (2 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf13c29f36a317776907e60de6c7a23b9fa830276ff9bc6c1b878f47bac75a5"}},{"ruleId":"D2","level":"warning","message":{"text":"asserters.assert_extension_array_equal (cognitive 31): asserters.assert_extension_array_equal has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 9, ternaries 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":"pandas/_testing/asserters.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e079f553ebb9426190ed3cbe1e25b160d5dc352f61dd2d55748e647bba5006b"}},{"ruleId":"D2","level":"warning","message":{"text":"boolean.coerce_to_array (cognitive 31): boolean.coerce_to_array has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 6 (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":"pandas/core/arrays/boolean.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e447612c12ca0caed6ae062f2c0202e080fe3e109c32ca8eb9dbe90fe4da77a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.quantile (cognitive 31): DataFrame.quantile has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DataFrame.quantile) 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":"pandas/core/frame.py"},"region":{"startLine":19720}}}],"partialFingerprints":{"codehealthFindingId/v1":"4404352c0ac12f96849193184e39f7b1bc228a5ce9bdc55004b373ff51246571"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.quantile (cognitive 31): DataFrame.quantile has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DataFrame.quantile) 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":"pandas/core/frame.py"},"region":{"startLine":19729}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb24d7f56e56ef4ba72b70331d13701ffc3e4a84d11005eaf024bad910d998f3"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocationIndexer._post_expansion_casting (cognitive 31): _LocationIndexer._post_expansion_casting has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 18). 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":"pandas/core/indexing.py"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d7addc4222c66447edcf13773c878fa16af9f87e53d0fe8a9a5c5b3b19b31a"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._setitem_single_block (cognitive 31): _iLocIndexer._setitem_single_block has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 7 (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":"pandas/core/indexing.py"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"97538612adbfd16c933ef9563f0a19b82516b7f8e587face96b332ef51ee684f"}},{"ruleId":"D2","level":"warning","message":{"text":"encoding.from_dummies (cognitive 31): encoding.from_dummies has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 2 (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":"pandas/core/reshape/encoding.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbec0ba27069abfc99d407d65d569c1b32d8c5311fb22eec28ecbf3e5d25f04"}},{"ruleId":"D2","level":"warning","message":{"text":"clipboard.determine_clipboard (cognitive 31): clipboard.determine_clipboard has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 4 (11 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":"pandas/io/clipboard/__init__.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4208b20d4e4ad993c4b26d6e7cc8b1fab27bf92f3bfa500b6e883b8e9d6750"}},{"ruleId":"D2","level":"warning","message":{"text":"algorithms.map_array (cognitive 30): algorithms.map_array has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 3 (12 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":"pandas/core/algorithms.py"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59f0cd089a0031dbd08b91fdad5a10de693212516a688ebc2ed853d8f29a8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Categorical._maybe_convert_categories (cognitive 30): Categorical._maybe_convert_categories has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (2 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":"pandas/core/arrays/categorical.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8081ac72871ea0fc136dcb81b40a1cf917a574364a638fe73236a8e389be2676"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalArray._ensure_simple_new_inputs (cognitive 30): IntervalArray._ensure_simple_new_inputs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 10 (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":"pandas/core/arrays/interval.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b92ed9fbf8e64a5715a3dcfc026450c30ee0518d216c6e705ac4d8cd5965f8"}},{"ruleId":"D2","level":"warning","message":{"text":"missing._array_equivalent_object (cognitive 30): missing._array_equivalent_object has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 3 (7 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/missing.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac7ff22f1efd5a48afc62aa8057c390b69874a346939584116d09cd8b7b12e"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseGrouper._reduceat_aggregate (cognitive 30): BaseGrouper._reduceat_aggregate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 4, ternaries 1 (2 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":"pandas/core/groupby/ops.py"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"9033e6bd1f41febc60087623f93c1188b4cda041ef84fdc2338486dd608550d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Index._join_level (cognitive 30): Index._join_level has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 3 (5 pts), boolean chains 2 (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":"pandas/core/indexes/base.py"},"region":{"startLine":4954}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb07ddb1d656949415c0b67c38f60b101e276bc73cf4de5c3f01cf2170edccc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.get_slice_bound (cognitive 30): Index.get_slice_bound has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), error handling 4 (9 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":"pandas/core/indexes/base.py"},"region":{"startLine":7268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e66beb121057f1e0f78c3a5824e8e5359ae5948f82e9a55e9c74d03ddebb444"}},{"ruleId":"D2","level":"warning","message":{"text":"pivot._add_margins (cognitive 30): pivot._add_margins has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 4 (5 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":"pandas/core/reshape/pivot.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a448c4234f365ed2102df003e1ba36dae77e94a91156681babe43f4f3b2729e0"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenpyxlWriter._write_cells_write_only (cognitive 30): OpenpyxlWriter._write_cells_write_only has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (10 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":"pandas/io/excel/_openpyxl.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3200bf05443e5c8057f4330f6d4b2fdc693855af7291907c20106cf25055818"}},{"ruleId":"D2","level":"warning","message":{"text":"Tooltips._translate (cognitive 30): Tooltips._translate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (12 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":"pandas/io/formats/style_render.py"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5047e4e46b806053621455d2c4cbe2917bb558cd7b41ae3c6fd7ca1ab65e66"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._daily_finder (cognitive 30): converter._daily_finder has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (30 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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bbe1bbbb4b45e6265124f63c5a74102df369dd50f542867879a69a970893a6"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalArray._cmp_method (cognitive 29): IntervalArray._cmp_method has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/interval.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53b85b5d41a000411cd62eb07a5fb226a24d69ab13b22329646b0f0190d3e78"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.__getitem__ (cognitive 29): DataFrame.__getitem__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 4, error handling 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":"pandas/core/frame.py"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2a72b9ee2f22a6e0d74cb7395dfe6b43b9ddda2825802c1933958b091c0422"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex._partial_tup_index (cognitive 29): MultiIndex._partial_tup_index has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, error handling 1 (3 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":"pandas/core/indexes/multi.py"},"region":{"startLine":3570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d768dad9ccc3e254bece33578079da54e73c7001d5344344caad545581cf7733"}},{"ruleId":"D2","level":"warning","message":{"text":"construction._homogenize (cognitive 29): construction._homogenize has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/construction.py"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbb75c64d5f523f92a26d312d48ab8a51bd8d5a7c49cbe8f4c69517d9d7d3cb"}},{"ruleId":"D2","level":"warning","message":{"text":"_AsOfMerge._get_join_indexers (cognitive 29): _AsOfMerge._get_join_indexers has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 4, ternaries 2 (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":"pandas/core/reshape/merge.py"},"region":{"startLine":2662}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6a1f5719c8e7520d806290aa99af33102f1b67c8c8f39544a2ae96f67994c9"}},{"ruleId":"D2","level":"warning","message":{"text":"tile._bins_to_cuts (cognitive 29): tile._bins_to_cuts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, ternaries 2 (4 pts), 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":"pandas/core/reshape/tile.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dfb77c47c0e205ab8736fd1f3192fb700daf1c5b1fa919ef4a09654b076f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"ODFReader.get_sheet_data (cognitive 29): ODFReader.get_sheet_data has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/excel/_odfreader.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3de9ff0bf9952e96983cf63c6b7d1659c000ce3264bc0e2551e25a3082ab22d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataCol.convert (cognitive 29): DataCol.convert has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (22 pts), error handling 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":"pandas/io/pytables.py"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65827603e9fdb8fee2af53cab107ec686495f07c5adecc4ae361ac3fe7a13e8"}},{"ruleId":"D2","level":"warning","message":{"text":"sum_.sliding_sum (cognitive 28): sum_.sliding_sum has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (10 pts), boolean chains 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":"pandas/core/_numba/kernels/sum_.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0497618843c87ef58f0e97b593a14aae873d9c73bb6653f37f001f11497ce87"}},{"ruleId":"D2","level":"warning","message":{"text":"algorithms.diff (cognitive 28): algorithms.diff has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/algorithms.py"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33ee52be5c98e75f65975b74d8834c6e568cd98d0025370d90f778e882c96e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray.to_numpy (cognitive 28): ArrowExtensionArray.to_numpy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 8 (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"2896b7ec9a5b5030e575db37edd09e6f2d28ee60193a6f9c5e19a6d8da78b6b9"}},{"ruleId":"D2","level":"warning","message":{"text":"align._align_core (cognitive 28): align._align_core has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (6 pts), ternaries 1 (4 pts), boolean chains 3 (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":"pandas/core/computation/align.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"063d360059443f96b690a5d5eee174f0820c7eaadff0f59034516146d816e53f"}},{"ruleId":"D2","level":"warning","message":{"text":"parsing._split_by_backtick (cognitive 28): parsing._split_by_backtick has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 1 (4 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/computation/parsing.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"56acae114a5d1ea03c64574a8605a28d8edad928a9b97f89db9a8bf4a5b39e14"}},{"ruleId":"D2","level":"warning","message":{"text":"BinOp.convert_value (cognitive 28): BinOp.convert_value has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, error handling 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":"pandas/core/computation/pytables.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"570cf221e05c3e70334087ec4b180f66ded3d6dcfcce865382453646310257ab"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.astype (cognitive 28): NDFrame.astype has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 1 (4 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":6637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fd1adf3d628ccb9ebde73ef04176219cd8bacefa3e11d905d9deec718c34e9"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.check_setitem_lengths (cognitive 28): utils.check_setitem_lengths has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 3 (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":"pandas/core/indexers/utils.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edf8cf591f9a8fa0a9ccd4b9d220741996f94f953e6aa8b3be83844eaacebd1"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex._reorder_indexer (cognitive 28): MultiIndex._reorder_indexer has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 2 (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":"pandas/core/indexes/multi.py"},"region":{"startLine":4511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4330c3bab1dbba885d1f5d8ca411eb4f1644a7de5c2ac4b17e4b5f2d451def8c"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeIndex._difference (cognitive 28): RangeIndex._difference has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 5, 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":"pandas/core/indexes/range.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9666c5238548140e61c3ae18ec71fdb812c2db09d21f7235bc2caa04011715"}},{"ruleId":"D2","level":"warning","message":{"text":"indexing.infer_and_maybe_downcast (cognitive 28): indexing.infer_and_maybe_downcast has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, error handling 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexing.py"},"region":{"startLine":4036}}}],"partialFingerprints":{"codehealthFindingId/v1":"b988a519b0b146dc42bffde14df5f4251ea1cc0ec68aa4c736ae83c14a4aa7f0"}},{"ruleId":"D2","level":"warning","message":{"text":"pivot._generate_marginal_results (cognitive 28): pivot._generate_marginal_results has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2 (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":"pandas/core/reshape/pivot.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c935edf9defbba22cd83843252bf8b7ef016d5126e93fdbca6233305a4ff3c"}},{"ruleId":"D2","level":"warning","message":{"text":"pivot.pivot (cognitive 28): pivot.pivot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 2 (3 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":"pandas/core/reshape/pivot.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9715eb1a573d1a34e88547c38cafbf559febba56e5cbcb93ec6c83dfb39c8"}},{"ruleId":"D2","level":"warning","message":{"text":"reshape._stack_multi_columns (cognitive 28): reshape._stack_multi_columns has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/reshape.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c425525097519af6813f94a358091b7ed4debcb278953218f186ab2ed9f3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"_XlsxStyler.convert (cognitive 28): _XlsxStyler.convert has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 2 (7 pts), loops 4 (7 pts), 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":"pandas/io/excel/_xlsxwriter.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf262eaae7342a8ec31e0e321bec3b1841adb2b25685f79a7772d50dbd77958"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._handle_usecols (cognitive 28): PythonParser._handle_usecols has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), error handling 1 (5 pts), loops 1 (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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"69338cbdf2ca90d1a65de53dfc7b0e959137d5700dbbf6ee72c1010a69045c93"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexCol.convert (cognitive 28): IndexCol.convert has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 5, error handling 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":"pandas/io/pytables.py"},"region":{"startLine":2753}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cce96dba87c4555fcc5872f26b0d44bba1a43b5b89ea5c8d79c3cf8dad4481"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericFixed.write_array (cognitive 28): GenericFixed.write_array has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (26 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":"pandas/io/pytables.py"},"region":{"startLine":3929}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12509b87611e0c7a7025a4b01c9cc90723e8d24a37479cc46c84c168f7b4778"}},{"ruleId":"D2","level":"warning","message":{"text":"SAS7BDATReader._read_amd_column_text (cognitive 28): SAS7BDATReader._read_amd_column_text has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/sas/sas7bdat.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cc6c51fae6a94e504e0216e2cf22dc3eef899fb0b030d72eff096012ed254e"}},{"ruleId":"D2","level":"warning","message":{"text":"DatetimeLikeArrayMixin._cmp_method (cognitive 27): DatetimeLikeArrayMixin._cmp_method has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), error handling 2 (5 pts), boolean chains 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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7e937fc055589c5533933fb46fabb9c7a6f52ecc0ec447f73b5910b2d6c273"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseMaskedArray.fillna (cognitive 27): BaseMaskedArray.fillna has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 1 (3 pts), boolean chains 2, error handling 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":"pandas/core/arrays/masked.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7273abe7f123ef80bec4021f17463085b05de4658bed4ba6a508fb9bf944eb"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseArray._reduce (cognitive 27): SparseArray._reduce has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"6794eeba60a25b757982c5f2be7fb164ea3c19d6b4e40a823f7574a46977aaf0"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame._drop_axis (cognitive 27): NDFrame._drop_axis has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 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":"pandas/core/generic.py"},"region":{"startLine":4775}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df68e5dac85f363a6a0b0ac0e25e5f7d282d995b0567b3e0df3ab819c01cad4"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._setitem_with_indexer_split_path (cognitive 27): _iLocIndexer._setitem_with_indexer_split_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, loops 2 (5 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":"pandas/core/indexing.py"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4f5b129d1a997eee32d9e8cbbad4e19aee4e0621c3bd45146aa921baf0caa7"}},{"ruleId":"D2","level":"warning","message":{"text":"nanops._wrap_results (cognitive 27): nanops._wrap_results has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (26 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":"pandas/core/nanops.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e781cfdb1b8df78f578455043e5065e597cd8729d690156b4f80c9ebdf1cb0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"_AsOfMerge._validate_tolerance (cognitive 27): _AsOfMerge._validate_tolerance has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (25 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":"pandas/core/reshape/merge.py"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c0b85fea90ffca22f3d0b7faf7c4cc5da79edd0d404454b3968feddec0038f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExcelFormatter.write (cognitive 27): ExcelFormatter.write has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (26 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":"pandas/io/formats/excel.py"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c26eeb5600389d6805a7d5e1dcdcc2b516f723400dd3e0bc909e97ed91dcd9"}},{"ruleId":"D2","level":"warning","message":{"text":"style_render._parse_latex_header_span (cognitive 27): style_render._parse_latex_header_span has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 4 (16 pts), if/else 6 (11 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style_render.py"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d27268203088679e7828d96590c5abe97cbc265435f2bf151cd558627dce99"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._get_index_name (cognitive 27): PythonParser._get_index_name has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (4 pts), error handling 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/python_parser.py"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e65283666ac0a6ae9f45aa2d189bd3f923bfb715df3b85d59d647ff24a17e1"}},{"ruleId":"D2","level":"warning","message":{"text":"readers._read (cognitive 27): readers._read has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 3, error handling 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":"pandas/io/parsers/readers.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b2180f53d77ab9ea89ced22d918b5691f94e6337bad6c3fc2ba642275ff2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"mean_.sliding_mean (cognitive 26): mean_.sliding_mean has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (10 pts), boolean chains 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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"455d790df28dda4a9df5f77bb2b124010977414f5edc01a9255d86ebab40c07f"}},{"ruleId":"D2","level":"warning","message":{"text":"var_.sliding_var (cognitive 26): var_.sliding_var has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (10 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":"pandas/core/_numba/kernels/var_.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b107c061a784fad3094192556a58718f5c99766aa50674e4cfb65d8aff26cdaa"}},{"ruleId":"D2","level":"warning","message":{"text":"astype.astype_is_view (cognitive 26): astype.astype_is_view has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (12 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/astype.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5138d71a014c25dba0581a5ea5a349e38b9ac85bc3f83ed11202c61070855d1"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.update (cognitive 26): DataFrame.update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 1, 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":"pandas/core/frame.py"},"region":{"startLine":13464}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b753c05d374fed1097e05c0411a6ed3204bb392e8ba24cbb683e8ec3cd48a91"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame._append_internal (cognitive 26): DataFrame._append_internal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (2 pts), ternaries 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":"pandas/core/frame.py"},"region":{"startLine":15669}}}],"partialFingerprints":{"codehealthFindingId/v1":"173ea3dae8c0d9fc7e0de7241777b87501d30a6775305e1c329a8fd5446479dc"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupBy.shift (cognitive 26): GroupBy.shift has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 2 (4 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":5246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f602b05230a283388754652e336568a686033f5af58612f1543d5aad0dd18569"}},{"ruleId":"D2","level":"warning","message":{"text":"Grouping._codes_and_uniques (cognitive 26): Grouping._codes_and_uniques has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (26 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":"pandas/core/groupby/grouper.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd15422531e98ef9a21ff9dfcefd74c0abc7714e38ce1e5dd0b4d990760693b"}},{"ruleId":"D2","level":"warning","message":{"text":"grouper._factorize_monotonic (cognitive 26): grouper._factorize_monotonic has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (23 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":"pandas/core/groupby/grouper.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b5ff7114f7a8cc82c8223622630151dd3240be821d50a12158a0b9725ebe05"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocationIndexer._maybe_mask_setitem_value (cognitive 26): _LocationIndexer._maybe_mask_setitem_value has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 5 (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":"pandas/core/indexing.py"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b30e67b9b0a63e95e00bae580f8ac671e53393157b15e6adce631eec82cb85d"}},{"ruleId":"D2","level":"warning","message":{"text":"nanops.nanmedian (cognitive 26): nanops.nanmedian has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, ternaries 1 (2 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":"pandas/core/nanops.py"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7977c990b79e312e2c66d1fecfb936d15a3178e4d68bd4725828368782f370"}},{"ruleId":"D2","level":"warning","message":{"text":"Styler.set_sticky (cognitive 26): Styler.set_sticky has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (6 pts), ternaries 3, 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":"pandas/io/formats/style.py"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ecc1af94fc648097ae2a93f21cb5a153e559678b81d13ccc57d7bdd636a69d"}},{"ruleId":"D2","level":"warning","message":{"text":"algorithms.value_counts_internal (cognitive 25): algorithms.value_counts_internal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, error handling 1 (2 pts), 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":"pandas/core/algorithms.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e5c0e953464898127d9ad42367b1cee06fae8772bece75571319a84db7c80"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray.__getitem__ (cognitive 25): ArrowExtensionArray.__getitem__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5 (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba937cd931b832b84eeea4f88c8e6fbde9d6b535ce6ba304ddf377c9ca65a5dd"}},{"ruleId":"D2","level":"warning","message":{"text":"cast.infer_dtype_from_scalar (cognitive 25): cast.infer_dtype_from_scalar has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), error handling 3 (6 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53b3d4f97a8e683575bbe46598086370a780b64d9faeb6f72b906e43193044c"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex._verify_integrity (cognitive 25): MultiIndex._verify_integrity has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"651ba777b739d2ef326a60b575b6775e23447e7604e13431f3b1c17e85d09eb5"}},{"ruleId":"D2","level":"warning","message":{"text":"Block.where (cognitive 25): Block.where has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 1 (3 pts), 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":"pandas/core/internals/blocks.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"34163f06829e523b8a4f94f7c9d85329c7b74aa6e8a6550ddd9c2be349a526af"}},{"ruleId":"D2","level":"warning","message":{"text":"EABackedBlock.where (cognitive 25): EABackedBlock.where has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (3 pts), error handling 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":"pandas/core/internals/blocks.py"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ffc64ecb0152ff9bc0b73c6d80c62633f420ee49a56b68ebc703242ae9aeac"}},{"ruleId":"D2","level":"warning","message":{"text":"missing._interpolate_1d (cognitive 25): missing._interpolate_1d has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (19 pts), ternaries 1 (4 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":"pandas/core/missing.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f773b3e8c3649db4e3b715675e4c7fbfbaf7ae46de2cb84ab9403501d27093d"}},{"ruleId":"D2","level":"warning","message":{"text":"reshape.stack_reshape (cognitive 25): reshape.stack_reshape has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 1 (3 pts), boolean chains 1, 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":"pandas/core/reshape/reshape.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b535588093571e4bbc4575f44e973c1bfc4200be1fece78cb148108503fec90"}},{"ruleId":"D2","level":"warning","message":{"text":"CParserWrapper.__init__ (cognitive 25): CParserWrapper.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/c_parser_wrapper.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0993035383bec7a6d9568a6de0334ab5bcf9fc0c975573d1ab101153f418b4"}},{"ruleId":"D2","level":"warning","message":{"text":"HDFStore.copy (cognitive 25): HDFStore.copy has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 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":"pandas/io/pytables.py"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4e8b64dc0cca8da0d41d8d6ecd83e1930eda75cf39169bd509af777bee47a6"}},{"ruleId":"D2","level":"warning","message":{"text":"pytables._maybe_convert_for_string_atom (cognitive 25): pytables._maybe_convert_for_string_atom has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":6344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59b54f4b305524aaea0e9a6d29bfb57fba8dd7d88bd2a7806e2a6f0fe837633"}},{"ruleId":"D2","level":"warning","message":{"text":"StataReader._read_old_header (cognitive 25): StataReader._read_old_header has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (4 pts), error handling 2, 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":"pandas/io/stata.py"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"492a91ee6e9bdc4180830eb76899a6dbe046f08f66a165e33d34d1bc18d111af"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._box_pa_scalar (cognitive 24): ArrowExtensionArray._box_pa_scalar has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 9 (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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb5abe1cab7568ae4a83e7e386ab8777d729904e6bb478864481a5b69144891"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray.__setitem__ (cognitive 24): ArrowExtensionArray.__setitem__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":3340}}}],"partialFingerprints":{"codehealthFindingId/v1":"64602bf263ff18f8a1003fdfae1e75e031a1d5a1f5c1672d76fc0f3e04a7e557"}},{"ruleId":"D2","level":"warning","message":{"text":"array._sparse_array_op (cognitive 24): array._sparse_array_op has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 5 (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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"266eb7e4a99202854fdabd5745f5844a65ca154dee39352a0e2adeca69741770"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupBy._insert_inaxis_grouper (cognitive 24): GroupBy._insert_inaxis_grouper has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"217e6b35c1ec5145fa06d99a89521bd285b44e34e577cfee029cb9821268a49b"}},{"ruleId":"D2","level":"warning","message":{"text":"Grouper._set_grouper (cognitive 24): Grouper._set_grouper has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4 (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":"pandas/core/groupby/grouper.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"37165ecc35e829e80866bdf00268a5b72139eeb1a8adb9dc226a453329de02eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Index._maybe_downcast_for_indexing (cognitive 24): Index._maybe_downcast_for_indexing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, error handling 2 (4 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":"pandas/core/indexes/base.py"},"region":{"startLine":6689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8324c4bbe9d0ffd406fbfc597b2e960497978a4406486e9d56ee440f9074ebe7"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocationIndexer._getitem_lowerdim (cognitive 24): _LocationIndexer._getitem_lowerdim has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, 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":"pandas/core/indexing.py"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c947255644ab33955d8cb870c81aef2171fb1660d2b1bb9260fbd167ed94e35b"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._validate_key (cognitive 24): _iLocIndexer._validate_key has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2 (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":"pandas/core/indexing.py"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"734e8b6d40448e6ce961385e54b1a631651296b9c91235407f89757877be18a4"}},{"ruleId":"D2","level":"warning","message":{"text":"EABackedBlock.putmask (cognitive 24): EABackedBlock.putmask has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (3 pts), boolean chains 2, error handling 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":"pandas/core/internals/blocks.py"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a78a4eec71e6168cdc0a588279e77ff1e0ca9aebcaa2f92b818f5a6b6a45ab"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockManager.as_array (cognitive 24): BlockManager.as_array has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4 (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":"pandas/core/internals/managers.py"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"6deb2e98f7cf66b40310c30cc55f6de57034a35ee4a21eaea6932d535b83aeb5"}},{"ruleId":"D2","level":"warning","message":{"text":"StringMethods.cat (cognitive 24): StringMethods.cat has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 4, ternaries 1 (2 pts), error handling 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":"pandas/core/strings/accessor.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff964a840efb2af4631c0022c6d42bac62e00e0568249d47d947b2e38d07767"}},{"ruleId":"D2","level":"warning","message":{"text":"style._bar (cognitive 24): style._bar has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 8 (10 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":"pandas/io/formats/style.py"},"region":{"startLine":4442}}}],"partialFingerprints":{"codehealthFindingId/v1":"39302c00c6fa2bf209a343e2302c6d1cc12254573acde6a0838b422edf92a4c8"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._make_reader (cognitive 24): PythonParser._make_reader has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (7 pts), boolean chains 2 (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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc3ff6dda47f72efd8a27366a1a094ce7c95c580c04abacbefb056a520fab1f"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonParser._cast_types (cognitive 24): PythonParser._cast_types has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, error handling 2 (4 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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e41b531b18f84afd008a7a72d50ad0bec0101ac145c36919721ee4dedba2f61"}},{"ruleId":"D2","level":"warning","message":{"text":"HDFStore.append_to_multiple (cognitive 24): HDFStore.append_to_multiple has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"3007c54a62fb27c1b685b53eccc9b75d59e38a223d91138efa2abad746751c71"}},{"ruleId":"D2","level":"warning","message":{"text":"hist.hist_series (cognitive 24): hist.hist_series has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, ternaries 1 (2 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":"pandas/plotting/_matplotlib/hist.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d2cd63af9413c59a0bed4a434d6e90a272f580ee32e04aeb1e90721f6bd236"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.dropna (cognitive 23): DataFrame.dropna has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (22 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":"pandas/core/frame.py"},"region":{"startLine":8644}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab77b3376ae027edc0c49b0f356f6a6d0fe8e87e29238dbe69ee2383b63b4d76"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.explode (cognitive 23): DataFrame.explode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":14466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2464085dc0c6b95a5e5b7d74fc38d37bb1eb283db19a30425468c6fb0281c8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.rename_axis (cognitive 23): NDFrame.rename_axis has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 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. This shape REPEATS in the file: one other method here (NDFrame.rename_axis) 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":"pandas/core/generic.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5f6264440e42836dbf9bd49a941923b211a51df44b016b7563210f1b419ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.rename_axis (cognitive 23): NDFrame.rename_axis has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 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. This shape REPEATS in the file: one other method here (NDFrame.rename_axis) 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":"pandas/core/generic.py"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0359bb2c395bcd1393bd91535925b7021d883b252a879df5c0aba78a10198b90"}},{"ruleId":"D2","level":"warning","message":{"text":"VariableOffsetWindowIndexer.get_window_bounds (cognitive 23): VariableOffsetWindowIndexer.get_window_bounds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (3 pts), ternaries 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":"pandas/core/indexers/objects.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c867abb1ec7673c699737b3994aaa58936b21273a95ca4b98ad7d439b45fb5d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.set_names (cognitive 23): Index.set_names has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (Index.set_names) 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":"pandas/core/indexes/base.py"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"077270da448335440abbb53ed59709c2e597f096177fca4cdc3799b3485a11ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.set_names (cognitive 23): Index.set_names has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (Index.set_names) 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":"pandas/core/indexes/base.py"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f11b4062ce238d11b18f6c0512578e9c0a81142bd17913df752794d1c93086e"}},{"ruleId":"D2","level":"warning","message":{"text":"Index._cmp_method (cognitive 23): Index._cmp_method has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7 (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":"pandas/core/indexes/base.py"},"region":{"startLine":7799}}}],"partialFingerprints":{"codehealthFindingId/v1":"3744cb71249fc4425e69a719ce0618caa7fffcc0f0ef0a529027a7a53a120e02"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex.get_loc (cognitive 23): MultiIndex.get_loc has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 3 (6 pts), loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":3660}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22146ee32d288d944832859b5b35a75b81632de0c576364a0ff4ace0f4169fc"}},{"ruleId":"D2","level":"warning","message":{"text":"array_ops.logical_op (cognitive 23): array_ops.logical_op has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3 (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":"pandas/core/ops/array_ops.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"17889dc2a3eb5aa17aecdc373881f8db0553de473831ddda81d3d6fcaeca78aa"}},{"ruleId":"D2","level":"warning","message":{"text":"resample._adjust_dates_anchored (cognitive 23): resample._adjust_dates_anchored has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/resample.py"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b0f7285045043ceccd7a709dbd108af51ba69524cad8a21b5417aeedc73edc"}},{"ruleId":"D2","level":"warning","message":{"text":"concat._sanitize_mixed_ndim (cognitive 23): concat._sanitize_mixed_ndim has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 2, loops 1 (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":"pandas/core/reshape/concat.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"747fa35c791c6957c1f7fd071b717281b9dca1f2bb06fc3d815bc9095d53a51a"}},{"ruleId":"D2","level":"warning","message":{"text":"concat._get_result (cognitive 23): concat._get_result has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (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":"pandas/core/reshape/concat.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f729c5c1bc5b5278aec24007049481c18e3728e852f7f81f500acaed03b5d80"}},{"ruleId":"D2","level":"warning","message":{"text":"concat._get_concat_axis_series (cognitive 23): concat._get_concat_axis_series has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/concat.py"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9bcfc1716f9599fb5d923b740a33fe3250dd7ed660e4d961c2b97bd802f1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"reshape.stack_v3 (cognitive 23): reshape.stack_v3 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/reshape.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caef6353b566beb1a465ad54d8f1451654c4e5aaedad6f5261431246e1ba04d"}},{"ruleId":"D2","level":"warning","message":{"text":"tile._nbins_to_bins (cognitive 23): tile._nbins_to_bins has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 2 (6 pts), boolean chains 3 (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":"pandas/core/reshape/tile.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"709e95ec0c67875d035021d4d49e767b1b19b771d8e2d41e882c484508efdb35"}},{"ruleId":"D2","level":"warning","message":{"text":"ODSWriter._write_cells (cognitive 23): ODSWriter._write_cells has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 8 (10 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":"pandas/io/excel/_odswriter.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"014c5cd99ed387da2339d14c930e91e2eea8476184f84eb2a53c72c1de293583"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowParserWrapper.read (cognitive 23): ArrowParserWrapper.read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), error handling 2, loops 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":"pandas/io/parsers/arrow_parser_wrapper.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"6002230b11322dfd82eaca4e41facbc4c87a39fecaf5b6bf4ed1d2d9464f0f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"readers._iter_physical_lines (cognitive 23): readers._iter_physical_lines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (9 pts), loops 2 (3 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":"pandas/io/parsers/readers.py"},"region":{"startLine":3691}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade2cfc0475b36332fecbed913369cfbc25215605ed767ffc628737fd8a79ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.scatter_matrix (cognitive 23): misc.scatter_matrix has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/misc.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"33469c3d4bcea52ff5d7483efbe9147652833d6088860259a391015050338371"}},{"ruleId":"D2","level":"warning","message":{"text":"_testing.shares_memory (cognitive 22): _testing.shares_memory has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5 (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":"pandas/_testing/__init__.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"571e82704201de7958aaab9686182901eb83557fb98650780b31373fb8937bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"min_max_.grouped_min_max (cognitive 22): min_max_.grouped_min_max has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 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":"pandas/core/_numba/kernels/min_max_.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49ca2a6ab38a994bf07984b3c4216a70c5ae3c10222199ca0a37e1c4f673960"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameApply._agg_list_like_frame_reductions (cognitive 22): FrameApply._agg_list_like_frame_reductions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 pts), error handling 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":"pandas/core/apply.py"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f3702443f9fb781890aaa1be37dd0579182c812980f66587be1775d7338bce"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes._validate_tz_from_dtype (cognitive 22): datetimes._validate_tz_from_dtype has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, error handling 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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":3036}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9aaa38d4f3f26748a950e169ed2804a8c5b276aaefeea834b9e2ecc9722864"}},{"ruleId":"D2","level":"warning","message":{"text":"PeriodArray._from_sequence (cognitive 22): PeriodArray._from_sequence has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/period.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d0f0ce163842cbd8ef7e9c6d239b30a14434a25687c4ee5df4df7ce4deba6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowStringArray._from_sequence (cognitive 22): ArrowStringArray._from_sequence has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5 (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":"pandas/core/arrays/string_arrow.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac33c9e62ff23f99ab81f122aa39cc06eb4074583e1dba1c88c628f370b8833"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseExprVisitor.visit_Call (cognitive 22): BaseExprVisitor.visit_Call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (5 pts), loops 1 (2 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":"pandas/core/computation/expr.py"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50a6ac16ea1b7e8d26aa14a42fddb53bdfd310b33da259e30572be8eb7baf67"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesGroupBy.value_counts (cognitive 22): SeriesGroupBy.value_counts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), ternaries 2 (3 pts), boolean chains 1, loops 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":"pandas/core/groupby/generic.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a72830f4341dd4a499577b979a19373e34328e8fc6a117069c7de4b503933b0"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseGrouper.result_index_and_ids (cognitive 22): BaseGrouper.result_index_and_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 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":"pandas/core/groupby/ops.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c2274fe17285902270ba223279fc756c2e71ba4fc3a01861c966050ef7ca1f"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex.isin (cognitive 22): MultiIndex.isin has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (3 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":"pandas/core/indexes/multi.py"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"842a65c5021bcb67da2a5cf4326799e9f8806dddd2c353834a0bccadc1e0ccdb"}},{"ruleId":"D2","level":"warning","message":{"text":"_AtIndexer._warn_if_expanding (cognitive 22): _AtIndexer._warn_if_expanding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 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":"pandas/core/indexing.py"},"region":{"startLine":3521}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ac863771d4ea53c7a1fe4a3ce22c43a52bd400748f13f078a318958e569ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"Block._replace_coerce (cognitive 22): Block._replace_coerce has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (5 pts), boolean chains 2 (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":"pandas/core/internals/blocks.py"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a755383070168d73650fa7d925b42fa6c373beb4febdc27563f6a530b0c1f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"concat.concatenate_managers (cognitive 22): concat.concatenate_managers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, 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":"pandas/core/internals/concat.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3e91dd7488bcf7462f9ed0f68a6fec3e45fff369bac30f47d2fbeb4a7a1b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"nanops._maybe_null_out (cognitive 22): nanops._maybe_null_out has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/nanops.py"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30dbc631d042db2bc226b0704dddb4ab4ab9ab7146bac973e467a4e56745cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"pivot._compute_grand_margin (cognitive 22): pivot._compute_grand_margin has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). 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":"pandas/core/reshape/pivot.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00d5a71cb707ec9e6c2533738b928377d77c2e80f65116bf1ff0d401e648685"}},{"ruleId":"D2","level":"warning","message":{"text":"Series.__setitem__ (cognitive 22): Series.__setitem__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 4 (6 pts), boolean chains 3 (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":"pandas/core/series.py"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea7eb2a690fbdb595b1b79a7363f9f82672b40151e8eca3af2e30be5fdf2c7b"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseWindow._validate (cognitive 22): BaseWindow._validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 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":"pandas/core/window/rolling.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edd0691bcd355718d4fc35b4a1b480a96e00e319e4511f4493d9a99b22644ed"}},{"ruleId":"D2","level":"warning","message":{"text":"StylerRenderer._generate_body_row (cognitive 22): StylerRenderer._generate_body_row has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 2, ternaries 1 (2 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":"pandas/io/formats/style_render.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"9defa618d02455410d8836b0dcdf4e98e9e0adea4ad74d2eeb136fff8a3b39e2"}},{"ruleId":"D2","level":"warning","message":{"text":"StylerRenderer.relabel_index (cognitive 22): StylerRenderer.relabel_index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (7 pts), loops 2 (4 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":"pandas/io/formats/style_render.py"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b42963dfe1fcf661890cf79f941471d5192ef47ce5656488dc5f11d992594a3"}},{"ruleId":"D2","level":"warning","message":{"text":"html._parse (cognitive 22): html._parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 3 (6 pts), boolean chains 3, ternaries 1 (3 pts), loops 2 (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":"pandas/io/html.py"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"112da89bfd7c79c4ca2eb979dade98b25a2f02f7220f7deaf659305b8690d1b9"}},{"ruleId":"D2","level":"warning","message":{"text":"TextFileReader._get_options_with_defaults (cognitive 22): TextFileReader._get_options_with_defaults has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/readers.py"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"041c7a6650a72c524412e46679287ae35ddeea0b0a7fe17b0a5bd2b2f66f5e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"HDFStore.info (cognitive 22): HDFStore.info has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (8 pts), loops 1 (3 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":"pandas/io/pytables.py"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"380e8a84bb789cab2e804ea7feb0176d2b5c37f0bd38c2a3825f6bb59af7f157"}},{"ruleId":"D2","level":"warning","message":{"text":"pytables.read_hdf (cognitive 22): pytables.read_hdf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"816f053801d7a87cd748a4de6c2064997d79520b9a62178b4fa45252428f8e81"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLTable.insert_data (cognitive 22): SQLTable.insert_data has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), error handling 1 (2 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":"pandas/io/sql/base.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d3c4ec01f44231d36f2f6deca6c81b383ecc5778c730c7aaf3a33b526fa658"}},{"ruleId":"D2","level":"warning","message":{"text":"StataWriter._check_column_names (cognitive 22): StataWriter._check_column_names has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb92c68a2413e140229e374add48c286dd1505bd5c62fb21568eaf42b483b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"LinePlot._make_plot (cognitive 22): LinePlot._make_plot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), boolean chains 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b71fea9ce7a4b78d8b7295edb06122af59138dd00946deeef5f2332f3e5b9"}},{"ruleId":"D2","level":"warning","message":{"text":"_warnings.assert_produces_warning (cognitive 21): _warnings.assert_produces_warning has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/_testing/_warnings.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"787ffc720f7b323a503c361577e01431c6da4efb3317e07862db92d194f73a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Apply.wrap_results_dict_like (cognitive 21): Apply.wrap_results_dict_like has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 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":"pandas/core/apply.py"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce3edec480e29da98207cf36cbe449bfeb78869b34bf5b81bcaf7fb774d321"}},{"ruleId":"D2","level":"warning","message":{"text":"take.take_2d_multi (cognitive 21): take.take_2d_multi has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7 (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":"pandas/core/array_algos/take.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f936475464575f17953f53da13bb4fcfa4182288cfbb08bd9d189ec8b46c5624"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions._can_use_numexpr (cognitive 21): expressions._can_use_numexpr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (3 pts), ternaries 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":"pandas/core/computation/expressions.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"21009ad098aef717c1c85026f9ea30a0ca3d26aac6d66f606a26d92c0e840910"}},{"ruleId":"D2","level":"warning","message":{"text":"cast.common_dtype_categorical_compat (cognitive 21): cast.common_dtype_categorical_compat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (2 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f44f2db87f3be556a5437504e22b38266a3c4f31beafaedec2ee1a79ab9fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.sort_values (cognitive 21): DataFrame.sort_values has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (20 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":"pandas/core/frame.py"},"region":{"startLine":9156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac95383b2c4e763237b1d080c0a24b3139f7e8794be6b1958450bd350172d93"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupBy._concat_objects (cognitive 21): GroupBy._concat_objects has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58ee33302fb3a3770ab77ce17991fe15b4d4dc284448e4daf6ffee9a47c04d9"}},{"ruleId":"D2","level":"warning","message":{"text":"range._exact_int64_targets (cognitive 21): range._exact_int64_targets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, error handling 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/range.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b1a48ec1cdb7eba9b21723cad4d3c42577522902eb2519065defaa5625bd09"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocationIndexer._maybe_restore_dropped_levels (cognitive 21): _LocationIndexer._maybe_restore_dropped_levels has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, ternaries 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":"pandas/core/indexing.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eeb644656eb7ed70e1a8f4f8e04f08d3b80b80c166f4bd07e14a90fa7a4c99"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._decide_split_path (cognitive 21): _iLocIndexer._decide_split_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, loops 1 (2 pts), 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":"pandas/core/indexing.py"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2d58eef685b5ac3ceca9bf4017d1b9d2bbe2c4486e6bbc34c81df91262ea54"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._setitem_with_indexer_frame_value (cognitive 21): _iLocIndexer._setitem_with_indexer_frame_value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexing.py"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcf6d5d24c38351f67f227b30bc35e083b43fb08b04b70d107965325860d11a"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseBlockManager.apply (cognitive 21): BaseBlockManager.apply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 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":"pandas/core/internals/managers.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a1b812ff55d068ef9ca8ec3f6d4b82750f4c045113d31cf49936214657ceef"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockManager.fast_xs (cognitive 21): BlockManager.fast_xs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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":"pandas/core/internals/managers.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1dec81a4f71ba05e76081b4ea70bcc338a793f1403ebade66070362e35dd11"}},{"ruleId":"D2","level":"warning","message":{"text":"nanops.nansum (cognitive 21): nanops.nansum has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 1 (3 pts), boolean chains 2, ternaries 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":"pandas/core/nanops.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"926a4c78bae5ba3a6c666c2206238513e71abfa072d760e7f2b0b4ed5d24fd6f"}},{"ruleId":"D2","level":"warning","message":{"text":"_MergeOperation._get_join_info (cognitive 21): _MergeOperation._get_join_info has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2147529b750a7c03ac4b3a8df6ffed7513b3f76a416454db73f927bc0437d89d"}},{"ruleId":"D2","level":"warning","message":{"text":"merge._convert_arrays_and_get_rizer_klass (cognitive 21): merge._convert_arrays_and_get_rizer_klass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (21 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":"pandas/core/reshape/merge.py"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"275d5ec3e1447203650d3931d1db4f50d78384b560f91b97a5e66b0cd230a456"}},{"ruleId":"D2","level":"warning","message":{"text":"_Unstacker.get_new_values (cognitive 21): _Unstacker.get_new_values has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 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":"pandas/core/reshape/reshape.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"189533d08edf9db73d5ec9d9ef08f1a728779a9354b8e824e573ecfedeab9114"}},{"ruleId":"D2","level":"warning","message":{"text":"reshape._unstack_multiple (cognitive 21): reshape._unstack_multiple has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 1 (4 pts), loops 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":"pandas/core/reshape/reshape.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ceb06794c9466a83355e930dccd114de044697ec583aa17315c1fa4d53b26a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExponentialMovingWindow.__init__ (cognitive 21): ExponentialMovingWindow.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, 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":"pandas/core/window/ewm.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd04dce269d91d1cbd208dde7cf1b3994d00c207d33507e98a6bf56ab76d2834"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesFormatter._get_footer (cognitive 21): SeriesFormatter._get_footer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5 (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":"pandas/io/formats/format.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b81f77b91cceeefda3c17822d05e078eac4b6a0b8bfd43ba1c8c92d6e6ad6a"}},{"ruleId":"D2","level":"warning","message":{"text":"_normalize.nested_to_record (cognitive 21): _normalize.nested_to_record has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 2 (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":"pandas/io/json/_normalize.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb839b3c12dad74f3ac83187a749993256d50919f435545896312fe43f4ea1d"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericFixed.read_array (cognitive 21): GenericFixed.read_array has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3 (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":"pandas/io/pytables.py"},"region":{"startLine":3681}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2309487719c3d72470228c015644e5ca72278eb77fe6f37bf623ba943768381"}},{"ruleId":"D2","level":"warning","message":{"text":"SAS7BDATReader._process_columntext_subheader (cognitive 21): SAS7BDATReader._process_columntext_subheader has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 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":"pandas/io/sas/sas7bdat.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2994e8037e13520eda86fd6bedc5e97e6793c213c7c84088d869d882c098b49"}},{"ruleId":"D2","level":"warning","message":{"text":"SAS7BDATReader._chunk_to_dataframe (cognitive 21): SAS7BDATReader._chunk_to_dataframe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 1, loops 1 (nesting depth added 12). 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":"pandas/io/sas/sas7bdat.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b156309f4bc611f4fd3ba2813bb5f3844f75af056c2f1350d1fa9ed99d3979"}},{"ruleId":"D2","level":"warning","message":{"text":"MPLPlot._validate_color_args (cognitive 21): MPLPlot._validate_color_args has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"083c9eb79b73c6649250126d9a06e067f612e8317a3a1bba3f793d9e22b78ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"take._take_preprocess_indexer_and_fill_value (cognitive 20): take._take_preprocess_indexer_and_fill_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4 (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":"pandas/core/array_algos/take.py"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8772f0300c9a90e6447df69f8abfae52f1f29e8f9878b29adf9d38ae8db6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseMaskedArray._pad_or_backfill (cognitive 20): BaseMaskedArray._pad_or_backfill has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 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":"pandas/core/arrays/masked.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"900b223eef1f65c53a6a009cde453d0816cd943583954b1701d2b441d1c9a336"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseArray.__array_ufunc__ (cognitive 20): SparseArray.__array_ufunc__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e408f708ee06369aed2cb520a57f560983c6c5969b9ad4f88baa812d02acec"}},{"ruleId":"D2","level":"warning","message":{"text":"cast.find_common_type (cognitive 20): cast.find_common_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (cast.find_common_type) 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a255e22f31dfdc0025b453e308aea283a26058d0704203a7319cef79b7ae5db"}},{"ruleId":"D2","level":"warning","message":{"text":"cast.find_common_type (cognitive 20): cast.find_common_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (cast.find_common_type) 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2dd0f3d848318e2b1ff54e77a073ebfdc039fa634bcc434fef94cc365acbba"}},{"ruleId":"D2","level":"warning","message":{"text":"concat.concat_compat (cognitive 20): concat.concat_compat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/concat.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"552524c0bc431a95e45318076e237afa4a81baf80c9953d9379d49c6ae6cf708"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.to_records (cognitive 20): DataFrame.to_records has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0bae9f9ee386524e91bdca4095d060a24df4b20f71ff0aedce7f415973027d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame._getitem_multilevel (cognitive 20): DataFrame._getitem_multilevel has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":4408}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3247ecf10b25aa1733e374a31ca823334050613df9254037a0d92baaf0b53e"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.intersection (cognitive 20): Index.intersection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 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":"pandas/core/indexes/base.py"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c3fb46a918be50c73aab8384da1816dc904541e0058eca5c21986ccf576328"}},{"ruleId":"D2","level":"warning","message":{"text":"DatetimeTimedeltaMixin._pin_freq (cognitive 20): DatetimeTimedeltaMixin._pin_freq has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"594b046ba798780cd028a28f100e36500581c9ba9f84e794ec269294806eb08c"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex.drop (cognitive 20): MultiIndex.drop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (4 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":"pandas/core/indexes/multi.py"},"region":{"startLine":2936}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48c33b8edf23a653a630530b9ff26462fd3df6ebce4430308a864175d801f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._setitem_new_column (cognitive 20): _iLocIndexer._setitem_new_column has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (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":"pandas/core/indexing.py"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"087a1c61437646e0e051e0bf9a9e50169e8146b6981195fc3d6dca37e934685a"}},{"ruleId":"D2","level":"warning","message":{"text":"construction._extract_index (cognitive 20): construction._extract_index has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/construction.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"430aa6c04b451dac1862269d29e1c425060d12db180a4f7ea607b7b8af90cbe7"}},{"ruleId":"D2","level":"warning","message":{"text":"nanops._sum_timedelta_i8 (cognitive 20): nanops._sum_timedelta_i8 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/nanops.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5c0f857fd2256af38a72dfc81237150fe63fd26cddfe0ebcf4ee7bd7dec727"}},{"ruleId":"D2","level":"warning","message":{"text":"Series.reset_index (cognitive 20): Series.reset_index has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 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":"pandas/core/series.py"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bdc6920b45dc7c95cf96698323ffbab8a31ef67206476d302b32e929c3f9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectStringArrayMixin._str_split (cognitive 20): ObjectStringArrayMixin._str_split has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4 (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":"pandas/core/strings/object_array.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7375e39924b71d7f8305e35f215ac5aba4574bf041184dd3647ead657633b42"}},{"ruleId":"D2","level":"warning","message":{"text":"_json._validate_pyarrow_engine_options (cognitive 20): _json._validate_pyarrow_engine_options has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/json/_json.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf89b78ab4f3718563785089fd0e4844060cff86d6e1163af51fc7ebf22c6b4"}},{"ruleId":"D2","level":"warning","message":{"text":"HDFStore._identify_group (cognitive 20): HDFStore._identify_group has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (6 pts), boolean chains 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":"pandas/io/pytables.py"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2ba3c5b61f9ecbcd93d99ddda7d64beb9084854a2409abd27b6a05d39de396"}},{"ruleId":"D2","level":"warning","message":{"text":"pytables._convert_index (cognitive 20): pytables._convert_index has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4 (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":"pandas/io/pytables.py"},"region":{"startLine":6173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb934c035108fd33ba9b5b9c2aef87808c5de487175e9134594caf5344b2b787"}},{"ruleId":"D2","level":"warning","message":{"text":"XportReader._read_header (cognitive 20): XportReader._read_header has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 1 (3 pts), loops 2 (3 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":"pandas/io/sas/sas_xport.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8822da6b2a5337556f7d7651e36d6e7e71d3425b5f320783820246519315bdd6"}},{"ruleId":"D2","level":"warning","message":{"text":"StataReader._read_new_value_labels (cognitive 20): StataReader._read_new_value_labels has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (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":"pandas/io/stata.py"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7a29dd98d67b92ae8335b81cc06791ea4fbc846d56b6041672114ed1bc3f63"}},{"ruleId":"D2","level":"warning","message":{"text":"boxplot.boxplot (cognitive 20): boxplot.boxplot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 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":"pandas/plotting/_matplotlib/boxplot.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3c3409d3fcbdf79b1c1caee3975b5b3fbbda7b5b5ce2a5de2a15d5a71645c0"}},{"ruleId":"D2","level":"warning","message":{"text":"MPLPlot._make_legend (cognitive 20): MPLPlot._make_legend has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6d02495a0e78a52ab43898c1c879dd845a27ff1b0c894ca10794aed54dfd65"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.parallel_coordinates (cognitive 20): misc.parallel_coordinates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (3 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, 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":"pandas/plotting/_matplotlib/misc.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4af5252a537d7def62a9fac1699d7a4fabd62fa97a6b8729c16ed8a0f751e72"}},{"ruleId":"D2","level":"warning","message":{"text":"Apply.compute_dict_like (cognitive 19): Apply.compute_dict_like has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (6 pts), boolean chains 2 (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":"pandas/core/apply.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18d10f6c9884be3682cb27debaeff82ae1799510c21f127b54b4f1eaf2b87eb"}},{"ruleId":"D2","level":"warning","message":{"text":"masked_reductions._minmax (cognitive 19): masked_reductions._minmax has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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":"pandas/core/array_algos/masked_reductions.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc020094c044c08e0a51e8c0e51b828b6c77875558d6cba8bf492ba908211ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray.__array_ufunc__ (cognitive 19): ArrowExtensionArray.__array_ufunc__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, ternaries 1 (2 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8140186c52776e9cbeb9e2fcc9560f0cd3fbd43cbd01c5785b1b5e4b7960b5b4"}},{"ruleId":"D2","level":"warning","message":{"text":"array._first_truncated_to_integer (cognitive 19): array._first_truncated_to_integer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":5129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df75e693c215d3ae902fbfd377be0ee14dfc9d9b7284f25ee7825ac1539d817"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes._sequence_to_dt64 (cognitive 19): datetimes._sequence_to_dt64 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimes.py"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba809f89644ab3531b0c9d752723e071b7245cab82a8f84bfeba2c0b037b19e"}},{"ruleId":"D2","level":"warning","message":{"text":"missing.array_equivalent (cognitive 19): missing.array_equivalent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 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":"pandas/core/dtypes/missing.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b1330dff9df85390bae6b0b7446c1860ce71d283af06b56c60ab4d1ba802ce"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.corr (cognitive 19): DataFrame.corr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), ternaries 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":"pandas/core/frame.py"},"region":{"startLine":16573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d199d707535b98a6606e7984a0c6658f0498e57f7075f26b93bafc29357e35c3"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame._align_series (cognitive 19): NDFrame._align_series has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":10348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff039a8274428daceb867704699fc481a59345ea1cdfe7c2379158d0c07631e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Grouping.__init__ (cognitive 19): Grouping.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"pandas/core/groupby/grouper.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f3aaa256ef30e9bdba56128fe72a2437d0b689ff0b64073ddb30e878e97dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.get_indexer (cognitive 19): Index.get_indexer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb1fd9dc3df0f8de94ccfddbbb1db8b2b22724c66b4fe56143d8958f49c844c"}},{"ruleId":"D2","level":"warning","message":{"text":"DatetimeTimedeltaMixin._get_delete_freq (cognitive 19): DatetimeTimedeltaMixin._get_delete_freq has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bae04b14169c378774e49a47d18f5543d03fc4f9a7c9b6cdaacee5d702fbca"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex._format_multi (cognitive 19): MultiIndex._format_multi has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (3 pts), loops 2, 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":"pandas/core/indexes/multi.py"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eb3e76db35764666d831789b015c4f0530a4a183fbfffbe13e5effc7d8cfdf"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeIndex.take (cognitive 19): RangeIndex.take has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/range.py"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"f513621697258fa381b54ca665613f0b822ddb5d2ce5f60e0e40bfac19a167bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Block.fillna (cognitive 19): Block.fillna has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d156c75023a59488d41d684b0c09bb14895cebabd81043f08ad0b3d528cb841b"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionBlock._unwrap_setitem_indexer (cognitive 19): ExtensionBlock._unwrap_setitem_indexer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7 (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":"pandas/core/internals/blocks.py"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b2f3cf6e9fd934b9802530c1f368cc4a3917371b20e9556e565484eda87740"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseBlockManager.reindex_indexer (cognitive 19): BaseBlockManager.reindex_indexer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d3b04f3f16b8e1620c419b8ae03e7e584268d94a605d86bd1a4a9faff216a5"}},{"ruleId":"D2","level":"warning","message":{"text":"missing._index_to_interp_indices (cognitive 19): missing._index_to_interp_indices has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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":"pandas/core/missing.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fce116ece0b8b0e13ce13a810a16a395a933849f856baf90cb34a588e6952c"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.preprocess_weights (cognitive 19): sample.preprocess_weights has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 1 (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":"pandas/core/sample.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcd13a1a345fa2714abb1ee1a2c3815bda6f311fc570e228f4a438694612581"}},{"ruleId":"D2","level":"warning","message":{"text":"Series.combine (cognitive 19): Series.combine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":3752}}}],"partialFingerprints":{"codehealthFindingId/v1":"3306e2208de960ce359344ee62e75121571ead76444e698d904c802de1fa15ea"}},{"ruleId":"D2","level":"warning","message":{"text":"accessor.str_extractall (cognitive 19): accessor.str_extractall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), ternaries 1 (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":"pandas/core/strings/accessor.py"},"region":{"startLine":4875}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9194751ee9758bf81ae0f9c528d6b25c5c1e5dd1dffc61416930fbe3812fb8c"}},{"ruleId":"D2","level":"warning","message":{"text":"printing._pprint_seq (cognitive 19): printing._pprint_seq has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2 (4 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":"pandas/io/formats/printing.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8edcfaddc1051e93234910e55b57122e656b5a6e518b219d57a9b803ef217d"}},{"ruleId":"D2","level":"warning","message":{"text":"c_parser_wrapper._concatenate_chunks (cognitive 19): c_parser_wrapper._concatenate_chunks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/c_parser_wrapper.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"205479b015ef468223ddca213bf4add6a81641783c63e96b0e016046594d2fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"AppendableTable.delete (cognitive 19): AppendableTable.delete has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":5634}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bc58d0483e592436a9418421559230d43af39bc2fd207407ea498d3edcbfec"}},{"ruleId":"D2","level":"warning","message":{"text":"MPLPlot._parse_errorbars (cognitive 19): MPLPlot._parse_errorbars has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3 (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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a02ce6e9492db73755f57b16e3a362dd12e1ad639dabd9524d2f173e08006a5"}},{"ruleId":"D2","level":"warning","message":{"text":"_warnings._assert_caught_expected_warnings (cognitive 18): _warnings._assert_caught_expected_warnings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, 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":"pandas/_testing/_warnings.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4e6133ea303134bb5053422bbf40726e5e922d2858c42c8b656044d8ddac3c"}},{"ruleId":"D2","level":"warning","message":{"text":"_warnings._assert_caught_no_extra_warnings (cognitive 18): _warnings._assert_caught_no_extra_warnings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 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":"pandas/_testing/_warnings.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"443940a2c09be56de56d09aed1bc8983cc57d652450cc70d58db3b073c7ac624"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray.factorize (cognitive 18): ArrowExtensionArray.factorize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"443271572eb14d824c29f1ebc712b105bda203e8794355eb9c1c025d4d0a6ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"DatetimeArray._add_offset (cognitive 18): DatetimeArray._add_offset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimes.py"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cd5249f9eb3d47b86b991bbbce70e61c2a960a2c48b2609db89b27e89ed760"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseMaskedArray.__iter__ (cognitive 18): BaseMaskedArray.__iter__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 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":"pandas/core/arrays/masked.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"260781f852c2dd53d215aeca45beffc22c842e1902a7dd6635dbb295799062d2"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseMaskedArray.astype (cognitive 18): BaseMaskedArray.astype has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, ternaries 1 (2 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. This shape REPEATS in the file: one other method here (BaseMaskedArray.astype) 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":"pandas/core/arrays/masked.py"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e7547a299e5c84f613ace519a4bafba0f56c52ffa0a031ee50053796f37d60"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseMaskedArray.astype (cognitive 18): BaseMaskedArray.astype has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, ternaries 1 (2 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. This shape REPEATS in the file: one other method here (BaseMaskedArray.astype) 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":"pandas/core/arrays/masked.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"392e6392c13fad5242387fa4c37c218bf305cd2d0663c10d423b35f132117547"}},{"ruleId":"D2","level":"warning","message":{"text":"NumpyExtensionArray.__array_ufunc__ (cognitive 18): NumpyExtensionArray.__array_ufunc__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/numpy_.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"458f34eecf4880830d6b75effb374d51b6b4ee421459876afb510fe19f6eb853"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexOpsMixin.to_numpy (cognitive 18): IndexOpsMixin.to_numpy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 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":"pandas/core/base.py"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f01ab128340355935ac91f41ff51f59ed88c21d5bb2fc7e2fb773eadc30eb3a"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.select_dtypes (cognitive 18): DataFrame.select_dtypes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (4 pts), boolean chains 3, 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":"pandas/core/frame.py"},"region":{"startLine":5498}}}],"partialFingerprints":{"codehealthFindingId/v1":"43218d143cdb3f3f6bd78a8e6dfa580a486d14f6f009c80a9bf9570489b7aceb"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.combine (cognitive 18): DataFrame.combine has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":13203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70f2e1967350d9244be2bf0fe9e722c349a0599d8e5468506cc2005bb99e4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.stack (cognitive 18): DataFrame.stack has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"pandas/core/frame.py"},"region":{"startLine":14249}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c8e4e304f506e89306fef801bcb140c7993b928e4f9ceb3015cc519ca040ef"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame._drop_labels_or_levels (cognitive 18): NDFrame._drop_labels_or_levels 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":"pandas/core/generic.py"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"038fae239eb84be5eb7f641bbbb4bcd1e7131f0bda8757e2a1864bc861e81e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.reindex (cognitive 18): NDFrame.reindex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":5320}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ccc0571d1503f489a13708852c83fa023e2a824d65f18c922dec168ba91ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame._clip_with_one_bound (cognitive 18): NDFrame._clip_with_one_bound has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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":"pandas/core/generic.py"},"region":{"startLine":8961}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26cb2482f35683130ebed69ec4717b49f1bf580663cd74088288a466b29f11d"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.__repr__ (cognitive 18): Index.__repr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"51753fc3dabc0e82a1650d1ee57ec94c711343e729dfe3100fdc62808c03cad6"}},{"ruleId":"D2","level":"warning","message":{"text":"Index._join_via_get_indexer (cognitive 18): Index._join_via_get_indexer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 2 (5 pts), 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":"pandas/core/indexes/base.py"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da2156de7221e7a03a5eb20db1a5cba7fc3c8e83279fe0101a526a76298871"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._setitem_with_indexer (cognitive 18): _iLocIndexer._setitem_with_indexer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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":"pandas/core/indexing.py"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd0152db58cb34d0b9b9e2e72ac4e8572c5686892ad9350f7b868373f32fa04"}},{"ruleId":"D2","level":"warning","message":{"text":"_iLocIndexer._setitem_with_indexer_2d_value (cognitive 18): _iLocIndexer._setitem_with_indexer_2d_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (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":"pandas/core/indexing.py"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"c877c72afd314bba2a9e9ea47e0165f62766beeab40682a9f5b94cd4228405d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Block.putmask (cognitive 18): Block.putmask has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts), boolean chains 1, 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":"pandas/core/internals/blocks.py"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc92ec79db1db2fd04c5b2defa1cfa7a5420e44b2467e04680b62c4e6c6a9a45"}},{"ruleId":"D2","level":"warning","message":{"text":"concat._clean_keys_and_objs (cognitive 18): concat._clean_keys_and_objs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, 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":"pandas/core/reshape/concat.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fd1eb0b662ff8beb3da04329b8ae1faaa45799e07985c504734bd37124fb3f"}},{"ruleId":"D2","level":"warning","message":{"text":"encoding.get_dummies (cognitive 18): encoding.get_dummies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/encoding.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f8132873ace03db24cc955e22d2100f6e0480212109b87b694aa022558b085"}},{"ruleId":"D2","level":"warning","message":{"text":"merge._fuse_key_view (cognitive 18): merge._fuse_key_view has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":3190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3601cae213758fb686c7000c6a3b94a20a3ec793be9774a90f076ab8001f7673"}},{"ruleId":"D2","level":"warning","message":{"text":"ExcelFormatter._format_regular_rows (cognitive 18): ExcelFormatter._format_regular_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 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":"pandas/io/formats/excel.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"e851cac56643a134e1b09826612496f24e58f4c7be97c076ff82719f25a519aa"}},{"ruleId":"D2","level":"warning","message":{"text":"HTMLFormatter.__init__ (cognitive 18): HTMLFormatter.__init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/html.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7ea4dcf1b6cf7b567be685851a186c7fa380c8540cbd4f40690fd211886774"}},{"ruleId":"D2","level":"warning","message":{"text":"Styler._apply (cognitive 18): Styler._apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 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":"pandas/io/formats/style.py"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edb9a43cd2fbf6351f57cb4b59b5a8afd9e35582c72fe15f330521816b6167d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.__init__ (cognitive 18): JsonReader.__init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 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":"pandas/io/json/_json.py"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9d59650156b25c3a587a5096da021ff66040a525ab12ff7a4d4869de724cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"_table_schema.build_table_schema (cognitive 18): _table_schema.build_table_schema has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (5 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":"pandas/io/json/_table_schema.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"22df4e04f9fd68259b7c0ab11bb225e29eaa3443eee967a607d42970a442ca5e"}},{"ruleId":"D2","level":"warning","message":{"text":"readers._refine_defaults_read (cognitive 18): readers._refine_defaults_read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/readers.py"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5754b1e4f8e00a0f34151d849d2662d834f148eca490610962dd4d8c2e88527"}},{"ruleId":"D2","level":"warning","message":{"text":"Table.validate (cognitive 18): Table.validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":4305}}}],"partialFingerprints":{"codehealthFindingId/v1":"656b913a389795694235114e50cd1322cda11bce01103e6aaf0bb74cd3db313d"}},{"ruleId":"D2","level":"warning","message":{"text":"Table.validate_data_columns (cognitive 18): Table.validate_data_columns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"pandas/io/pytables.py"},"region":{"startLine":4765}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eef3c18b9f79df0aaa9db1e682c894fb3ddbd3f6b6149ca8d8acab5a26f4dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Selection.__init__ (cognitive 18): Selection.__init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (5 pts) (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":"pandas/io/pytables.py"},"region":{"startLine":6640}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fba6fa983cd42b8418d3ab8d5c4c1a938a81c9518fa537a8edf2df82274ac7"}},{"ruleId":"D2","level":"warning","message":{"text":"SAS7BDATReader._parse_metadata (cognitive 18): SAS7BDATReader._parse_metadata has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, 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":"pandas/io/sas/sas7bdat.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"defcaaaf354fc428a36db6b0646b4efacfb599ee324cd1e10f83144cd2f8189d"}},{"ruleId":"D2","level":"warning","message":{"text":"sas7bdat._utf8_translation_table (cognitive 18): sas7bdat._utf8_translation_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 3 (6 pts), loops 4 (5 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":"pandas/io/sas/sas7bdat.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5644c00441d89d5591ea19ffd80ac8eb43ba9d860bcbae05627880479a7490"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLTable._harmonize_columns (cognitive 18): SQLTable._harmonize_columns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 5, error handling 2 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/sql/base.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"6066a0eaf8cc8da5ec56aa7b6c37686aeea50cfb6efa4db5cb273d9a6cbb63b8"}},{"ruleId":"D2","level":"warning","message":{"text":"HistPlot._make_plot (cognitive 18): HistPlot._make_plot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1, 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":"pandas/plotting/_matplotlib/hist.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba41bfadf3835a953ebeeba86fd89271b4c894ac1bbe178cadf53e259a397760"}},{"ruleId":"D2","level":"warning","message":{"text":"hist.hist_frame (cognitive 18): hist.hist_frame has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/hist.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a5a697379fed1b0b6a4f912a03567fef6c1ba6a9a04b6eeec4c5a0288c191f"}},{"ruleId":"D2","level":"warning","message":{"text":"tools._get_layout (cognitive 18): tools._get_layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/tools.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1f9921c55e7e8833e2214c1df87aa9eebe8df494ed9e1e601b0fc271047e10"}},{"ruleId":"D2","level":"warning","message":{"text":"var_.grouped_var (cognitive 17): var_.grouped_var has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, 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":"pandas/core/_numba/kernels/var_.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3f588ab05d0339d784e9677d505d13883665fff636efef4fd4604cb05476fe"}},{"ruleId":"D2","level":"warning","message":{"text":"take._take_2d_multi_object (cognitive 17): take._take_2d_multi_object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/array_algos/take.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"de77a1af619dd9452c7b152ef1b8552468360ff06cc62b7387284c3a88dc030a"}},{"ruleId":"D2","level":"warning","message":{"text":"Categorical.astype (cognitive 17): Categorical.astype has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Categorical.astype) 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":"pandas/core/arrays/categorical.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fed3eb8552eb3db1fc6f10dc94d4523d9fc4aef12b32225de0ac6f24fd4a8ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Categorical.astype (cognitive 17): Categorical.astype has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Categorical.astype) 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":"pandas/core/arrays/categorical.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75aa142492cef2e47339a060b57938d761525334d5789621dccf39a2433be1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Categorical.map (cognitive 17): Categorical.map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/categorical.py"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e191ce3dff4c79a201a03d1c95f414c5ece6202f7cbfb482cf92e0cc0e500753"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalArray.astype (cognitive 17): IntervalArray.astype has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 3 (6 pts), ternaries 1 (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":"pandas/core/arrays/interval.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"0290e78c41b1d2839f59124cdd56c2245974ca797dee59f739d8805cea489a5c"}},{"ruleId":"D2","level":"warning","message":{"text":"period._get_ordinal_range (cognitive 17): period._get_ordinal_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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":"pandas/core/arrays/period.py"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c88b8812fe49fd8853f8bf9e9f49d25a4f4c4f94165f70ef3bd46558e2c8320"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseArray.__array__ (cognitive 17): SparseArray.__array__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9d5b5e8caaddbb998f6f41c628fde08ec75804f90ceda61798bb860869b2cc"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseArray._arith_method (cognitive 17): SparseArray._arith_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7199f39283932fb698ec2c245c8c9b547e994aa8e31e417cdb248ebce9193cd"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseStringArray._str_map_nan_semantics (cognitive 17): BaseStringArray._str_map_nan_semantics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 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":"pandas/core/arrays/string_.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a632c4d334ee8fa4295676b40e097871f9a02b0a602d4efc7960422a6680db"}},{"ruleId":"D2","level":"warning","message":{"text":"astype._astype_nansafe (cognitive 17): astype._astype_nansafe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/astype.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6986c2fb78481fb8abb2542c6e6b6dc2f2be20b9fa0dc4233a4579b95e2768b2"}},{"ruleId":"D2","level":"warning","message":{"text":"cast.maybe_cast_to_integer_array (cognitive 17): cast.maybe_cast_to_integer_array has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"913a67bdfe0e83d5ac19aa4df8a59e9368112fd2a2b27ddf19fbdbd1d86cda54"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.query (cognitive 17): DataFrame.query has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent 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 (DataFrame.query) 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":"pandas/core/frame.py"},"region":{"startLine":5059}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b33445d9fde9f28d30e57f9ece225f12b0edadda388612c8b7a571d32a088"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.query (cognitive 17): DataFrame.query has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent 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 (DataFrame.query) 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":"pandas/core/frame.py"},"region":{"startLine":5072}}}],"partialFingerprints":{"codehealthFindingId/v1":"486c8f40a85d183c09a21ea99221d81626b4b0635132fb377232d87b6d058312"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.sort_index (cognitive 17): NDFrame.sort_index has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":5264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1f19a413eb427acf718a1fa1e2aa64bc96e1b652cbc2a6687f99d43db7343a"}},{"ruleId":"D2","level":"warning","message":{"text":"NDFrame.interpolate (cognitive 17): NDFrame.interpolate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 2 (3 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":"pandas/core/generic.py"},"region":{"startLine":8241}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf26ba831f6ac8874ba74b01826c493b8d34678edcaf3e668a28e0c1bc4d0b25"}},{"ruleId":"D2","level":"warning","message":{"text":"Index._check_indexing_method (cognitive 17): Index._check_indexing_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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":"pandas/core/indexes/base.py"},"region":{"startLine":4063}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3f20ccc7e6098374cfc7c61b658c3c702f5b0db05ef730ada5d7f68888635c"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.map (cognitive 17): Index.map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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":"pandas/core/indexes/base.py"},"region":{"startLine":6861}}}],"partialFingerprints":{"codehealthFindingId/v1":"8981ee93339d2622bf93f00f32ef526c91a42e78e0e7cdfb11db325dcd357af6"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.slice_locs (cognitive 17): Index.slice_locs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":7374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26d362cf4d37f5c8475281f7f02ec3b146d78ec7ed0fb12d14e6156e668b26a"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.min (cognitive 17): Index.min has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (Index.max) 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":"pandas/core/indexes/base.py"},"region":{"startLine":8139}}}],"partialFingerprints":{"codehealthFindingId/v1":"422f5272db406f787a4dabcb9a6d76d2db03ea97f8025a3f479276cddc28c3c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.max (cognitive 17): Index.max has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (Index.min) 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":"pandas/core/indexes/base.py"},"region":{"startLine":8220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9c0ea5ce9fe86f3b77795a83f64ee5afdd8adea026a5bbcc9e327fcf56c218"}},{"ruleId":"D2","level":"warning","message":{"text":"base.maybe_sequence_to_range (cognitive 17): base.maybe_sequence_to_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":8332}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa69316726c1ddde46c797b6fa23f00365674c6b256f857e0802c90b508256b"}},{"ruleId":"D2","level":"warning","message":{"text":"TimedeltaIndex._get_arith_result_freq (cognitive 17): TimedeltaIndex._get_arith_result_freq has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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":"pandas/core/indexes/timedeltas.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"382eb22cc7846068ff646a49cc62d941c6c0aac84985e4abafea71f79d4f2418"}},{"ruleId":"D2","level":"warning","message":{"text":"timedeltas.timedelta_range (cognitive 17): timedeltas.timedelta_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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":"pandas/core/indexes/timedeltas.py"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8afb510080a6363d71871ac9165a17eea0526f6f0a668d7700f1073893ebd9"}},{"ruleId":"D2","level":"warning","message":{"text":"_MergeOperation._validate_validate_kwd (cognitive 17): _MergeOperation._validate_validate_kwd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e31321ba34037a7e4f84911a7a46b02864c162c855fd903ab023e85a1c3019f"}},{"ruleId":"D2","level":"warning","message":{"text":"pivot._normalize (cognitive 17): pivot._normalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (4 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":"pandas/core/reshape/pivot.py"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"56980cd3bb8f82b84d02ec625046db26bdcbd083951ec58ec58fa6f02b4bfa48"}},{"ruleId":"D2","level":"warning","message":{"text":"Series.case_when (cognitive 17): Series.case_when has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":6781}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d598d83d8e71d2788d8cdd59b01eeec23b720f2c5cb0bf570d429674749131"}},{"ruleId":"D2","level":"warning","message":{"text":"sorting.get_group_index (cognitive 17): sorting.get_group_index has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/sorting.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"208fdd2567f2199641dfe0f3918780bdd18e37005846eedf9689f2b378ffecf4"}},{"ruleId":"D2","level":"warning","message":{"text":"accessor._preprocess_regex_pattern (cognitive 17): accessor._preprocess_regex_pattern has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"pandas/core/strings/accessor.py"},"region":{"startLine":4913}}}],"partialFingerprints":{"codehealthFindingId/v1":"c232108ebb7ef7769c44532fc16534f0c189753bb4a3da77a4cb0bccdf75f72d"}},{"ruleId":"D2","level":"warning","message":{"text":"datetimes.should_cache (cognitive 17): datetimes.should_cache has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, error handling 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":"pandas/core/tools/datetimes.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c99262faf076bda1ab4d3635276de608e4cdbbcf3d12717bd4fa259ea473f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Rolling._validate (cognitive 17): Rolling._validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 2 (5 pts), boolean chains 4 (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":"pandas/core/window/rolling.py"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc334e31119501a04272e3cd5a287c30118f8f1a27e628b385cabb071df2784"}},{"ruleId":"D2","level":"warning","message":{"text":"ODFReader._get_cell_string_value (cognitive 17): ODFReader._get_cell_string_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/excel/_odfreader.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cda5cd8ab7efe9e76975d2d723a826d0d656518681c8a920a093c1f53a4a3c0"}},{"ruleId":"D2","level":"warning","message":{"text":"_GenericArrayFormatter._format_strings (cognitive 17): _GenericArrayFormatter._format_strings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 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":"pandas/io/formats/format.py"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c593184d85a6760a6c7a188f915268a868b0676e35a3d48dbffcf12165ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"StylerRenderer._render_typst (cognitive 17): StylerRenderer._render_typst has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1, 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":"pandas/io/formats/style_render.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5725b0053f0e3de51b9ee9c3688d86e4a5216c0b17487fffbbb6bdb1b9729328"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserBase._clean_index_names (cognitive 17): ParserBase._clean_index_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/base_parser.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d2dfbc83d9878881366fc7aa9a8b1af1fce330d93ab00916dca57fd8b9543c"}},{"ruleId":"D2","level":"warning","message":{"text":"readers._clean_na_values (cognitive 17): readers._clean_na_values has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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":"pandas/io/parsers/readers.py"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6c95205bb9fb904bcc3b3b19ee00670294e5a970cdb18bfc95d769de5f6cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"AppendableTable.write_data (cognitive 17): AppendableTable.write_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":5531}}}],"partialFingerprints":{"codehealthFindingId/v1":"456189ad0f6f7d21ab8ef5e5934830f8c3408a3e04cc5f3cd4824fce481a0ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"StataWriter._prepare_categoricals (cognitive 17): StataWriter._prepare_categoricals has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"pandas/io/stata.py"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b96db782b9f218285d83ebf51f6765fab957e7e57625ecd9bf8093bba0a27a"}},{"ruleId":"D2","level":"warning","message":{"text":"PiePlot._make_plot (cognitive 17): PiePlot._make_plot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a4c23eb4e708a3d35b472bf480c683333b988459e9015172d1c083efaa323e"}},{"ruleId":"D2","level":"warning","message":{"text":"timeseries.maybe_resample (cognitive 17): timeseries.maybe_resample has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 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":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"37afc7058c9a0dd4a2f02058eebdf10382fbf1d7efe6a41ff8e475884d699ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"asserters.assert_almost_equal (cognitive 16): asserters.assert_almost_equal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"pandas/_testing/asserters.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd00adc5bb3601c46d8d168905f5478b480e06cfa4f1df3693eea6b5f13e226f"}},{"ruleId":"D2","level":"warning","message":{"text":"Apply.transform (cognitive 16): Apply.transform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 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":"pandas/core/apply.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae9cf0068e772722557b3bbd065407ab1e9868586bfc42662e91da2cefb02e4"}},{"ruleId":"D2","level":"warning","message":{"text":"arraylike.dispatch_ufunc_with_out (cognitive 16): arraylike.dispatch_ufunc_with_out has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (2 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":"pandas/core/arraylike.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab51fe9a2c9bb37c351a65ba0af4e3b5218a71a386eb5027e85c577887a859e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowExtensionArray._validate_setitem_value (cognitive 16): ArrowExtensionArray._validate_setitem_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, error handling 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":3672}}}],"partialFingerprints":{"codehealthFindingId/v1":"2290c01547dac51f2e1c3c4932e7ca20fc9cd8f39d16cabe4b09e86fdf9cebe6"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionArray._groupby_op (cognitive 16): ExtensionArray._groupby_op has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"pandas/core/arrays/base.py"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b279216f157d61d431b363c34ea9c423eb4e28e6db1add2d0aa35607fe1c45bd"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseMaskedArray.__array_ufunc__ (cognitive 16): BaseMaskedArray.__array_ufunc__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c582c6d2cb5a6888fc9de6a5c95abe6a8198d86555923f359e5ccba09c8d0a2c"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseMaskedArray._reduce (cognitive 16): BaseMaskedArray._reduce has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 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":"pandas/core/arrays/masked.py"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8205d9d31e755e7c35a471f4b271bff62b84853192dbc780e03c431160d3ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"PeriodArray.to_timestamp (cognitive 16): PeriodArray.to_timestamp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (6 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":"pandas/core/arrays/period.py"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cec90b2290e1d8b67fd05a326707a8a1c765a0a9a418e1fd977e95f49a3102"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseArray._cmp_or_logical_op (cognitive 16): SparseArray._cmp_or_logical_op has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab5a57ae0d3a06ce3f5f4ab9739f8b9950a3f35732ec44e861cf94b1c773d59"}},{"ruleId":"D2","level":"warning","message":{"text":"common.is_bool_indexer (cognitive 16): common.is_bool_indexer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1 (nesting depth added 9). 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":"pandas/core/common.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"699af4a483553b476950d08189dbcd9ffb988ab90b6c4eec13b63c1cc05f694a"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseExprVisitor.visit_Compare (cognitive 16): BaseExprVisitor.visit_Compare has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (8 pts), if/else 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 9). 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":"pandas/core/computation/expr.py"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"f794eda6c309e7cfd51dd26238ec840c62d60233a3b235dadf21315bf2610e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"construction._try_cast (cognitive 16): construction._try_cast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"pandas/core/construction.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0b34626d45b692b4a5b48f96f5f26a94414662d7d61eb025485e7637eed107"}},{"ruleId":"D2","level":"warning","message":{"text":"concat.union_categoricals (cognitive 16): concat.union_categoricals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/concat.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e3dfaba7c3022c8af748e69ed3fd6130fe3238b1c8a6c39f4cf70ad3a47eed"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.from_dict (cognitive 16): DataFrame.from_dict has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"pandas/core/frame.py"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3e8359b70e83ffbc031212a217eae8697cb68aa606d6235b230a468a1e2300"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesGroupBy.aggregate (cognitive 16): SeriesGroupBy.aggregate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"pandas/core/groupby/generic.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"880e80700e07518fd1c948b39d2a003717005f088cc824f6f2024753cce71128"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrameGroupBy.aggregate (cognitive 16): DataFrameGroupBy.aggregate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/generic.py"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b019f78497b7389a81da74dc465561f27e2ae86582301b4e9b7e70bdf2b9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupBy.size (cognitive 16): GroupBy.size has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a9d82681c899ce1da998d819cd58a9c5d9a53669518ee253cd8c7f7da2436d"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.check_array_indexer (cognitive 16): utils.check_array_indexer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 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":"pandas/core/indexers/utils.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"0682893473e696d354d853c66886a6513170ad31113297ac553e22cca18236d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.take (cognitive 16): Index.take has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (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":"pandas/core/indexes/base.py"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d2135b81e6b14115f8b0c22bba9f5e5c26bc1450b9071e01d323b0f3aea9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Index.insert (cognitive 16): Index.insert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":7552}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5cf1971582bccd9178ebddce187897797ec68b37e326f4405a534cf4f434a1"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiIndex._union (cognitive 16): MultiIndex._union has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 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":"pandas/core/indexes/multi.py"},"region":{"startLine":4715}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1a16094e9ec939346f5b720900705cf6064545b3ddc6743b11a3da69e12bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"TimedeltaIndex.__new__ (cognitive 16): TimedeltaIndex.__new__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/timedeltas.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db75b6eb4c99b75b37ae7c379702d0aa94fe8e38180624a4c16d78e724cf735"}},{"ruleId":"D2","level":"warning","message":{"text":"Block._replace_regex (cognitive 16): Block._replace_regex has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f4485a7885af7b99e85b21d464b72946102f29a4a8913f5af65e60010fae13"}},{"ruleId":"D2","level":"warning","message":{"text":"Block.setitem (cognitive 16): Block.setitem has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b868ca499a10cbf62c6bd8f2e1181c439475b08a7e139dd5059e5afbb52dddf"}},{"ruleId":"D2","level":"warning","message":{"text":"managers._form_blocks (cognitive 16): managers._form_blocks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (2 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d713bd5a0ba86b3285385ec3d82af8aac64952ee5b541f8f05c6c2559fbd583d"}},{"ruleId":"D2","level":"warning","message":{"text":"missing.mask_missing (cognitive 16): missing.mask_missing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/missing.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e0f6108ab07017781e33d7184ae0d483c43723d55d8001318fd0dc83358495"}},{"ruleId":"D2","level":"warning","message":{"text":"missing._interpolate_scipy_wrapper (cognitive 16): missing._interpolate_scipy_wrapper has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"pandas/core/missing.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafa71bc0f0c329877382127d3fec6b587cf605afd3ed8019c9cb53918934456"}},{"ruleId":"D2","level":"warning","message":{"text":"nanops.nanvar (cognitive 16): nanops.nanvar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/nanops.py"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad43611112c994d37bbb49d2463d9c27d6a8ddfc26385c8f5a889e542645396"}},{"ruleId":"D2","level":"warning","message":{"text":"array_ops.comparison_op (cognitive 16): array_ops.comparison_op has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7 (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":"pandas/core/ops/array_ops.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"640bfb76e4d7af07d350434fca727acccbda107bc305b6758fa00ee1f06f9fef"}},{"ruleId":"D2","level":"warning","message":{"text":"resample._get_timestamp_range_edges (cognitive 16): resample._get_timestamp_range_edges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/resample.py"},"region":{"startLine":2972}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8cf233830c90cd9c713688cb6672f70fb7df84d6cc34cbbc9742248a895cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"concat._get_sample_object (cognitive 16): concat._get_sample_object has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/concat.py"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d621c64c9bde298cff2d4124f2cf3cfd0e32c690e210e6ba4bad0ca9442a11"}},{"ruleId":"D2","level":"warning","message":{"text":"common.mangle_dupe_names (cognitive 16): common.mangle_dupe_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 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":"pandas/io/common.py"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"170656bf1ebad10d7c63a94bb4e7aaa1de29ecec4a509aced616dae22b89a920"}},{"ruleId":"D2","level":"warning","message":{"text":"CSSResolver.size_to_pt (cognitive 16): CSSResolver.size_to_pt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (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":"pandas/io/formats/css.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71e33754d323f347b8526a162c61a67f92e5d3dd59aeb2b8c786044702ce1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"CSSToExcelConverter._border_style (cognitive 16): CSSToExcelConverter._border_style 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":"pandas/io/formats/excel.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b68f8d645b3a74802a1a447f18c59bea3f02d2796073b7d590d07d8e344868"}},{"ruleId":"D2","level":"warning","message":{"text":"StylerRenderer._translate (cognitive 16): StylerRenderer._translate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style_render.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58b5409e5198c0e4904ed95cb2c517575754720c5b68e0f42c40bbf14b9f78f"}},{"ruleId":"D2","level":"warning","message":{"text":"StylerRenderer._generate_col_header_row (cognitive 16): StylerRenderer._generate_col_header_row has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (5 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":"pandas/io/formats/style_render.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cba5d97af05a441cafb5704a090a1eaef248ac19a3f9e4fb92fab6c89bf616"}},{"ruleId":"D2","level":"warning","message":{"text":"style_render._parse_latex_css_conversion (cognitive 16): style_render._parse_latex_css_conversion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style_render.py"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b0bb6d24803ae63c1d92661257f572441e39243af50688a27d1c8f99964efe"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericFixed.read_index_node (cognitive 16): GenericFixed.read_index_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":3839}}}],"partialFingerprints":{"codehealthFindingId/v1":"3606ec7095934ce81e634a8c72118e9ffd71ade35eb9731bb7d7eae2e6615edf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLTable._sqlalchemy_type (cognitive 16): SQLTable._sqlalchemy_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 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":"pandas/io/sql/base.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"1226a58025674b1003e3ecf8d2467273c37b4dd7c29d02bf5eb1e8b8054fbb1b"}},{"ruleId":"D2","level":"warning","message":{"text":"base._handle_date_column (cognitive 16): base._handle_date_column has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (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":"pandas/io/sql/base.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79db87a50e8785c209a8332b5a1a5c7523dab9b8037477a5d8a8bb6ed349862"}},{"ruleId":"D2","level":"warning","message":{"text":"StataReader._read_strls (cognitive 16): StataReader._read_strls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4efb42d4627cf26d4272f34c08913b4cace5e5ff0b7d32fd161cc00c40cb60"}},{"ruleId":"D2","level":"warning","message":{"text":"DatetimeConverter._convert_1d (cognitive 16): DatetimeConverter._convert_1d has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64065fd625879a88c680e9ed2c0a4efefd6580257824545fd48ca486e37970b"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeSeries_DateFormatter.__call__ (cognitive 16): TimeSeries_DateFormatter.__call__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ebc30f4f9021eeb73b956bcc4481489f8197a4765bf4029618d5809fdbb264"}},{"ruleId":"D2","level":"warning","message":{"text":"MPLPlot._get_errorbars (cognitive 16): MPLPlot._get_errorbars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ec672a9bb62d2849af13f7fc95fc718ab98ab37c5df535a30ff93e13a33c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScatterPlot._make_plot (cognitive 16): ScatterPlot._make_plot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd46695bd3df70bf2450f37a13ae5a4526c3c4c3bd40fad4ee4c42de6decb59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/frame.py: FileTooLong \u2014 11151 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10651 over it, 22.30\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":"pandas/core/frame.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67d677a08587d7e7a5f999a92201b4dca8935b3cdcb3bde78ee5b63686170e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/generic.py: FileTooLong \u2014 4541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4041 over it, 9.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"374d042c061fd9661b5bbe1026ad48eb088bc8cc9b4ebeb43523a09eebecc4a3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataFrame: TooManyMethods \u2014 249 methods. The bar is 30 methods; this is 219 over it, 8.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":"pandas/core/frame.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d93fbe6b041e824cf9abeb4abe473e5e4a27d0c67838e63deadff7590cc04e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/pytables.py: FileTooLong \u2014 3695 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3195 over it, 7.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":"pandas/io/pytables.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbe4d9836b591a4f1d8f66a080105fe134eca57f2efd733713ebe335de50fba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: indexes/base.py: FileTooLong \u2014 3545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3045 over it, 7.09\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":"pandas/core/indexes/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc369927384a6d3a0d5108c8dc5571f2fa142dbe68b748fb0b7b6bae7c1906cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Index: TooManyMethods \u2014 207 methods. The bar is 30 methods; this is 177 over it, 6.90\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":"pandas/core/indexes/base.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"926279cc8c275da6fe87cda091adaf0e8645b3f49b3b62e42b45eddd3ffc27e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrow/array.py: FileTooLong \u2014 3276 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2776 over it, 6.55\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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1ffe1240c6c034428518e2272021676fe76a1b986451beef0b85d6182acb4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: strings/accessor.py: FileTooLong \u2014 3234 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2734 over it, 6.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":"pandas/core/strings/accessor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b78f4b04c5b319e5441ba0371f83a9f94d29df9284cad0297c699cf785bcca7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NDFrame: TooManyMethods \u2014 194 methods. The bar is 30 methods; this is 164 over it, 6.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53d98c8996ba765d5507f290d62b7ca3c1502971db3fcdeae89f6feee95f89c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Series: TooManyMethods \u2014 166 methods. The bar is 30 methods; this is 136 over it, 5.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":"pandas/core/series.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"300860a75d0cda3df79a9c9dcfeae68548189f48cf3b46568ee4e1a996498435"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/style.py: FileTooLong \u2014 2451 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1951 over it, 4.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":"pandas/io/formats/style.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab6f58b8be3a98c89f516748402c94a71654fe007382d29012190630a0d78c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArrowExtensionArray: TooManyMethods \u2014 144 methods. The bar is 30 methods; this is 114 over it, 4.80\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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e926a55e603a5cb649b3406c73a1777c05fb15b7330e2e92bebdae2a4582e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: indexes/multi.py: FileTooLong \u2014 2340 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1840 over it, 4.68\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":"pandas/core/indexes/multi.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3075b2c3ab4a0ed4a880a3aa13e3838f7472ac18a9bc0be5fce94f403894062"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/series.py: FileTooLong \u2014 2263 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1763 over it, 4.53\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":"pandas/core/series.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae19860ac6c997affc126e750832cd3dbba5353916fc9d46684b095ab4a8e229"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/stata.py: FileTooLong \u2014 2140 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1640 over it, 4.28\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":"pandas/io/stata.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b53aee10032b3f1196ae763d5e99aefa7371f76d3ef3846cb2d855615c735f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reshape/merge.py: FileTooLong \u2014 1905 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1405 over it, 3.81\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":"pandas/core/reshape/merge.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc686f25849d1c09d2742e2d87f9dbba434fc95b5ea9dd84135ec5592c5f47c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: groupby/groupby.py: FileTooLong \u2014 1867 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1367 over it, 3.73\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":"pandas/core/groupby/groupby.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a969a4ac6988dad293ba066eae0e7b1cd03c40b64a1818bfaf408c76c9468f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _matplotlib/core.py: FileTooLong \u2014 1765 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1265 over it, 3.53\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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"510831fb5b624f9833edd3176908eab0f3077798930b74024086da2cf0dd120d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MultiIndex: TooManyMethods \u2014 101 methods. The bar is 30 methods; this is 71 over it, 3.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a73749e470872453b6f4f103f9face1f78fe3fd91b6c1f1b728b960e064bc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/indexing.py: FileTooLong \u2014 1623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1123 over it, 3.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":"pandas/core/indexing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0678cbfe156ba21549cf8f056e96180e6d34805de4c5f721b8bfce91d2e3ee6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sparse/array.py: FileTooLong \u2014 1606 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1106 over it, 3.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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55096cc73393f7b8fb73a40c1a0b9848b03de5c54a1550b72f4bfe3c8e28e03a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internals/blocks.py: FileTooLong \u2014 1496 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 996 over it, 2.99\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":"pandas/core/internals/blocks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22e62366891a810e8769310ac328123069af1f6611b0872952f847a18ab98d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internals/managers.py: FileTooLong \u2014 1487 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 987 over it, 2.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":"pandas/core/internals/managers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70194ca0c7777684016227238d2378de16a2eb421c1e67bf6bbb22d60f95cf17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseMaskedArray: TooManyMethods \u2014 85 methods. The bar is 30 methods; this is 55 over it, 2.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":"pandas/core/arrays/masked.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a6d131fe3662758fd28301a7a0f9e6e7a9ce667ecd5f2b0c7904c2099a0a15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/apply.py: FileTooLong \u2014 1406 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 906 over it, 2.81\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":"pandas/core/apply.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe9d9a4bd29bbde836019a5ca36cfa0fca77eaaaf463a96ca251225ba4b6e88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/style_render.py: FileTooLong \u2014 1398 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 898 over it, 2.80\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":"pandas/io/formats/style_render.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad459e66bf050e10f6865136b9ea3b24764785d370eb9026f6eae2c7d2c25672"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsers/readers.py: FileTooLong \u2014 1372 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 872 over it, 2.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":"pandas/io/parsers/readers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b44a3bfd9a48d3cb6d590345175234b0a09d7e4289681c5c31a09c4ce091c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/format.py: FileTooLong \u2014 1371 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 871 over it, 2.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":"pandas/io/formats/format.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28b68eab6ad143db0841abfd7afb42555f7b69f00d6a7f90c126d99ef217865"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/masked.py: FileTooLong \u2014 1330 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 830 over it, 2.66\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":"pandas/core/arrays/masked.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa444e981e3363d5b168873bf950f5f4fd5a0d32e3c1685fca144904a79c0a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: window/rolling.py: FileTooLong \u2014 1315 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 815 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":"pandas/core/window/rolling.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc64fdd2c7d0cd989835d95dfa1f226530d76ce6262e82978114430af768713e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/categorical.py: FileTooLong \u2014 1269 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 769 over it, 2.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":"pandas/core/arrays/categorical.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8487c46ed984dc1b87d231f62e8fbc9480e41e712db6956232b9e1212a14a7a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SparseArray: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ca134d90db8257cc8313633821a4843556d4c26205d41d5e5775e43c3af487"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/datetimes.py: FileTooLong \u2014 1258 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 758 over it, 2.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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a7012d502f25578aaebd2c66493913d955c43ac0119020dc11df377d8896c8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtensionArray: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\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":"pandas/core/arrays/base.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddea280b9aafb86991386e7cd8817505666fbcc403e909e0b87db0cb4f9d2220"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/datetimelike.py: FileTooLong \u2014 1245 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 745 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34768accca82a3a6db7ccd9886d3509ab2102b8b631c3350e6be62142adc640c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dtypes/dtypes.py: FileTooLong \u2014 1227 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 727 over it, 2.45\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":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9993a0b8dddfd5670645251cc034ef14d5bac0c87862cd3125b3e1829d90025"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Categorical: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/categorical.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fcdf385c33b257eaca46278e2dc3305bf475f4cf70305293ac1ac54a288727"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/resample.py: FileTooLong \u2014 1181 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 681 over it, 2.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/resample.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"073fdc5ce3750ed64016c996d3921a8ab9f685b64f778b1d84d48b6a424d4e49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/nanops.py: FileTooLong \u2014 1147 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 647 over it, 2.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":"pandas/core/nanops.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa20ac039b1ff12159a6998c8c9313c1185518b39d042844e1b0327ed53c3f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RangeIndex: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.27\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":"pandas/core/indexes/range.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c1d9d80a95ae8f4c8fdd5992f29e0b8bde8ab6eb1aac6a0ae61fc1cf1c1907"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: groupby/generic.py: FileTooLong \u2014 1118 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 618 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":"pandas/core/groupby/generic.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9184ac5b156420ebe245e74394227f12078dfe6d6f5cc35739bfbbfe582549"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GroupBy: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.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":"pandas/core/groupby/groupby.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dae5e15408e62fa25633c0a981aca7b341923e295a0810406ebe14ac22e0d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/_json.py: FileTooLong \u2014 1095 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 595 over it, 2.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":"pandas/io/json/_json.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c46df31de0e181e2649fc60c1d04f08d4c78f4329d38ba6e45830c038a3e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsers/python_parser.py: FileTooLong \u2014 1083 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 583 over it, 2.17\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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e90f3e7fed29790ba7afbfe3fcc684a9072f67ddf0814b44ec49aadc30bd43"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StringMethods: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/strings/accessor.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"032e2712204ed31fe6d8b566311060fb6d9b836b315265a25c5dbaba18b20172"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/base.py: FileTooLong \u2014 1040 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 540 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df97bc98dd1088430557d2147bfcc3bca51bfe8bb32e07800ad15b985e2e7348"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatetimeLikeArrayMixin: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1084e3220551780272b829c3b181cc569a2b453d1f675be6cb26bec514b87557"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dtypes/cast.py: FileTooLong \u2014 1027 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 527 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c98fa8a883ef9461975877e8e98276d64b096971d04f29b8c3df18b19b3447c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: indexes/range.py: FileTooLong \u2014 1027 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 527 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":"pandas/core/indexes/range.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f74f8e3002eccd7fe2118683017a662367b831af7b4158569b9912e0a58b754"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: groupby/ops.py: FileTooLong \u2014 1017 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 517 over it, 2.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":"pandas/core/groupby/ops.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeaaff03a66e0774ee16fc8c772fc568c0f95602f3764eaac3a57dd2d58b628"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/interval.py: FileTooLong \u2014 951 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 451 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":"pandas/core/arrays/interval.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"210f9676e6cc04ab2305cbe7e67e259a6f55c75fb73a74aabd38f94e3f6c1044"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _testing/asserters.py: FileTooLong \u2014 938 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 438 over it, 1.88\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":"pandas/_testing/asserters.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8080fb3df30ee5c9fdd2991a1a6787dbb26c40a5cb1d113c98192df2865a95cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Block: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.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":"pandas/core/internals/blocks.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"85596d192e63a64d8f8d5758374e9f8973b61e2d9e87d93436039b97119fc2c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ObjectStringArrayMixin: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.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":"pandas/core/strings/object_array.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bf2ccd39011fd549e66e1b0e385e40ca261b0a070afa7f2642ebdcbc0be179"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/base.py: FileTooLong \u2014 905 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 405 over it, 1.81\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":"pandas/core/arrays/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a9e306755d1378d1eae5f38c602783aa3597abd421a75576527e8a56814b71"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Styler: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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":"pandas/io/formats/style.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9caae423b174d3cfd37b10458238ca4f8f838ed6df0417508813e9a264a7bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntervalArray: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\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":"pandas/core/arrays/interval.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c4cfe2f6275d2e392ed1d413aef09d854b4ff05838ee17435110fcb801a499"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: excel/_base.py: FileTooLong \u2014 859 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 359 over it, 1.72\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":"pandas/io/excel/_base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b43116fb790c0ac03a17287419b3e95a55aadec60831c4b23b3a937649d4e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _matplotlib/converter.py: FileTooLong \u2014 857 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 357 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b64c0393ba7d67c9e68e5fd8df425208268d4eb8ae5c57a94ac688ebb6c5c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/algorithms.py: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 over it, 1.69\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":"pandas/core/algorithms.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a54390b19aa68a41edf4488011658303fa4de8490bf406fc506d7a1af05b2ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sas/sas7bdat.py: FileTooLong \u2014 843 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 343 over it, 1.69\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":"pandas/io/sas/sas7bdat.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13361b60a09136c1771321184c0307da346fd11918febf68539836ed1938b23a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/common.py: FileTooLong \u2014 826 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 326 over it, 1.65\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":"pandas/io/common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c86106e8f89a33d302c3f21484498ab2cc8eb8b10d542818ad2134fe9adfa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/datetimes.py: FileTooLong \u2014 807 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 307 over it, 1.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":"pandas/core/tools/datetimes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8eae26003c329efd1824f5484a335b9ab1b8e3ab627436032476482ad04023"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArrowStringArrayMixin: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"pandas/core/arrays/_arrow_string_mixins.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fe53a8ce2b8f10a6c265313588b2d2d9e82cf9a41e727472b57aeba3990656"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseBlockManager: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"pandas/core/internals/managers.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2f009dd924c4ee8d89658a46f04803cf7255a07af103f83883c50abd1f38f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: indexes/datetimelike.py: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 284 over it, 1.57\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":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3805113630193800341a06344ad5eff620f0dfb18d4c479520024a99cc83d36b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expression: 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":"pandas/core/col.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c980f6aa0dca95509126b43dc9fed37c4757cdb661b55a22867439989c88ca95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/xml.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":"pandas/io/xml.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7ab638cd7a82059d1d33ea71f52d8af2e43251490439642eef9c4bf867f088"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/string_.py: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 256 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":"pandas/core/arrays/string_.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb917d234ec2024a7e193c1ff35d568ec63bd217a1ff9b7f025658bed217f80a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: indexes/datetimes.py: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 240 over it, 1.48\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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0d291b972b77f4df2c4a2bafb10f25574c995649be3ec97fe60eb4f989cf0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/period.py: FileTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 229 over it, 1.46\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":"pandas/core/arrays/period.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"899cd4c61b431c0d6b49f0de52f4d6f5b5e6cc8bbdc3257a3012df73fc1e4d6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrays/timedeltas.py: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 228 over it, 1.46\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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d538abdad50cd819675c815139acc407957f7621ecb2cc665006d78fdf349e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StataReader: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"pandas/io/stata.py"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"13050af0e2b1a5028b26303108bcb625f27dc851ad8aaa7df0b49de32f60cbd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsers/base_parser.py: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 207 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":"pandas/io/parsers/base_parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd35d9db27ab11039a80094275ac7bba9f735db09e0e1695425977a8564d6188"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MPLPlot: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fd9a218e0578313dbbdbfe4603b5869052ceb567b3219a1db135373390d7d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internals/construction.py: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 187 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":"pandas/core/internals/construction.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54132d84150d035610b8c04ad234f7a5336970113416bf6c5f7cdf86339fbbec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reshape/reshape.py: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 175 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/reshape.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f9c424bfadcd2d5953a8d7caeec186568625f0f2b6f609aa5b8ed402287886"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HDFStore: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"pandas/io/pytables.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"584004e4e161493994d669f0c54c99edd0d4dbf33702d1017134b03de38d2c2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/missing.py: FileTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 164 over it, 1.33\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":"pandas/core/missing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eb41abbf2f7e84b7e10dfd40ca98ba9b036dc094fe0d25ce667588972c39d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatetimeTimedeltaMixin: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.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":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12b6c6d829712b55b5d45d9ae895a4156aabf9335c5841d0a55560c296331db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntervalIndex: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.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":"pandas/core/indexes/interval.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e29c2728c78b214437ee1a35b78133212f197a3086738f94a6edae60522cb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reshape/pivot.py: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 139 over it, 1.28\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":"pandas/core/reshape/pivot.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58a5ad6122e99e6f7876f1f2a1f4c19d228846ac100b8277e045549fcc88384"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/html.py: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 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":"pandas/io/html.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4955051add8b3c93a443df2d758e2308585b4b07469d24b45815d4cf4f8b1f27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reshape/concat.py: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 119 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":"pandas/core/reshape/concat.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a087b532aa49d6a87d6fcf72ebb5e344b78ac88976ccdc288fb3f2e03e6304"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StringArray: 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":"pandas/core/arrays/string_.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5dbb7cc7f1f36cc9f42d1325445f2244f312f1a2443d962f102db94dd65995"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resampler: 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":"pandas/core/resample.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d7e2cc738217e93f38f60e2f6f332e6c93bd3f93fdecd0d6faf4babbd4b8ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SAS7BDATReader: 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":"pandas/io/sas/sas7bdat.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4d68caeca309a7e63dcc1105ed1f581a0bf2e12f77364778121a5224ae64a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/base.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":"pandas/io/sql/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd20798d578c3bca8b6ea29119031011291a04cc19420adaa211c49d50e54797"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: indexes/interval.py: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/interval.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c217e630ef49df494676639e50bad909e8fe489a62ae1a288c183ed6ca7cf0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TimedeltaArray: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1894770c16e6da2a89ec304a22917612eaa020b1678e47fbb5b9d39f812770b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatetimeArray: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimes.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2265a747cf102cefb75a8d5f492e7860d73488daca76c3e1a6d8f0a729c7d967"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NumpyExtensionArray: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/numpy_.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4bf2eacc6801d3fc96ee4622227834a6bff0cfbad75b0ae710c393a845f48a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: window/ewm.py: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/window/ewm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2955834e6b0542429df0d214d9e6f0fddb6a4531dc7db1d402551a4ae965a954"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NDArrayBackedExtensionArray: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/_mixins.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0a9b891664da6c3411d5f9fbc5b551c6e606f4a6b9f267b7dc592bbc5fb225"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatetimeIndex: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimes.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b5509be0a4f8514ff4debae0430e90ffca47c3d9970b14c35a67d70eb650f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StataWriter: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":2458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4354ea8ef1ad5b44c107958458cea267d86ba267dab6cc697ebb357508d3d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: groupby/grouper.py: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/grouper.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0075e7dcabbfb736b65afe18b7d434b8e426b24275e49d599a64ffaec70c4e03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: computation/expr.py: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.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":"pandas/core/computation/expr.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc0ee9a220b116137e2b5dcb96e03101cc245e3bf46d8a2b1ef074f84fb64cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpsMixin: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arraylike.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5955c1545d784e3dd0adc650c3cbe09b389b71d3a45f5183a6c329ca4a37e128"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): pandas/core/frame.py:1100-1218 | pandas/core/frame.py:3248-3443 | pandas/core/frame.py:3509-3720 | pandas/core/generic.py:3899-4088 | pandas/io/excel/_base.py:203-563 | pandas/io/html.py:1085-1295 | pandas/io/json/_json.py:660-1020 | pandas/io/xml.py:889-1230 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd65c8d451b1dda3133d7f8d90ba573b6aa0de72849a5784bd4352f37cb1415e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): pandas/core/arrays/arrow/array.py:1253-1312 | pandas/core/arrays/base.py:3118-3143 | pandas/core/arrays/categorical.py:1989-2014 | pandas/core/arrays/masked.py:893-968 | pandas/core/arrays/numpy_.py:264-323 | pandas/core/indexes/base.py:983-1024 \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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1b198e4585fcb8a8e5d0a46e443730ccd4efa5efc5bf7f3644fdd219388421"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): pandas/core/groupby/generic.py:4129-4238 | pandas/io/excel/_base.py:766-841 | pandas/io/excel/_base.py:1759-1933 | pandas/plotting/_core.py:172-279 | pandas/plotting/_matplotlib/hist.py:586-654 \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":"pandas/core/groupby/generic.py"},"region":{"startLine":4129}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e90576ccd681cee4a6e72c027f2e9502c8f2f1aa36ea536a2aca8d84497519"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): pandas/core/internals/blocks.py:1257-1321 | pandas/core/internals/blocks.py:1324-1431 | pandas/core/internals/blocks.py:1868-1940 | pandas/core/internals/blocks.py:1944-2017 \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":"pandas/core/internals/blocks.py"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e63e77636d84bd57df2cb9394e133d122d82509c76e75c2759f864a8c8f97ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): pandas/core/strings/accessor.py:752-947 | pandas/core/strings/accessor.py:951-1084 | pandas/core/strings/accessor.py:1088-1176 | pandas/core/strings/accessor.py:1180-1268 \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":"pandas/core/strings/accessor.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"69140f68d38017ab5bdfb403c6d131e8441ad39cded4f9b30ad8478408d6725c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): pandas/core/arrays/datetimelike.py:1328-1391 | pandas/core/arrays/datetimelike.py:1399-1460 \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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"459cc7f22c3d2883fb75ded3a643118375350e8c6e5f96041a9f33af12543a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): pandas/tseries/frequencies.py:544-601 | pandas/tseries/frequencies.py:605-663 \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":"pandas/tseries/frequencies.py"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5081c526bca39c338f2892a9fe696d9827fd3ff553b1f28fa69069a0d100b8c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): pandas/core/window/numba_.py:270-349 | pandas/core/window/online.py:22-91 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/window/numba_.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7e56deb4fbcb667726cbbd13cd11cc5278c7a5df1a4114bd70426345c7113a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 86\u002B corresponding lines): pandas/core/_numba/kernels/mean_.py:75-162 | pandas/core/_numba/kernels/sum_.py:73-158 | pandas/core/_numba/kernels/var_.py:83-168 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 86 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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb968d2226a365241ac9d2edafa12f35f09863291b81280a64dcf4122d765e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (93 corresponding lines): pandas/core/generic.py:11377-11469 | pandas/core/generic.py:11481-11682 \u2014 These two members are one piece of code written twice and then edited apart: 93 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":11377}}}],"partialFingerprints":{"codehealthFindingId/v1":"248c3f92b7028a8e0cde27cf4bb7582b4332990bb5e40cf2c172af63d211926c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): pandas/io/formats/style_render.py:619-682 | pandas/io/formats/style_render.py:766-817 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style_render.py"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d3e2e58b7da0246d37e65c6fea49aa51cbddd060e4f8f961b8528c64d1a4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (121 corresponding lines): pandas/io/formats/style_render.py:1307-1487 | pandas/io/formats/style_render.py:1667-1787 \u2014 These two members are one piece of code written twice and then edited apart: 121 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style_render.py"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a82b55676b6b76d89e536675bdf08be326abff272d60101956d5cfc2443e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): pandas/core/nanops.py:1724-1772 | pandas/core/nanops.py:1785-1833 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/nanops.py"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33724393b8b0a0241e9e32a14b17704ac57cf2203cde37627181d03783ced6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): pandas/core/indexes/base.py:8146-8218 | pandas/core/indexes/base.py:8227-8300 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":8146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6609ae4a6a6c4b8b0df9a49e03b9b232d8474a8d3c2a4b41c250c5264a2e0011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): pandas/core/groupby/numba_.py:72-120 | pandas/core/groupby/numba_.py:129-177 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/numba_.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"47570f0d815e51047bca330a997c22805faf9f173b8ce53c3148d8c2798c0242"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (95 corresponding lines): pandas/core/frame.py:19397-19491 | pandas/core/frame.py:19496-19590 \u2014 These two members are one piece of code written twice and then edited apart: 95 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":19397}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef4833d5602e1c831305a60a4140e9aabf66a19d35c5a89f0d97b8b4121ecce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 32\u002B corresponding lines): pandas/core/window/ewm.py:826-913 | pandas/core/window/ewm.py:921-1012 | pandas/core/window/rolling.py:1921-1952 | pandas/core/window/rolling.py:1961-1992 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 32 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":"pandas/core/window/ewm.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b0eb715e9879514d036d77e7ffc47d69ecef803eb3464e793ac62595680380"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): pandas/core/window/ewm.py:542-623 | pandas/core/window/ewm.py:631-714 \u2014 These two members are one piece of code written twice and then edited apart: 82 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/window/ewm.py"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c163adc112edfe060a8b47ba893451eb60ebcceb3c0a17d2d98261c5072e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): pandas/io/formats/xml.py:371-407 | pandas/io/formats/xml.py:463-499 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/xml.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d91c4a13588c245d8d9b05b83a5727cdc4f73ea9f2eb67331263c0e395a51df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): pandas/core/indexes/multi.py:958-989 | pandas/core/indexes/multi.py:1204-1234 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d74fd1cfcedc991bea7becd222606afe57f3eec252dcdea863fc1d7b738fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): pandas/core/window/numba_.py:27-75 | pandas/core/window/numba_.py:182-232 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/window/numba_.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"de99de90fa19a9e0e0f21dde862685297291edea0ae6cceb9dad5a25e2279a53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): pandas/core/arrays/timedeltas.py:716-742 | pandas/core/arrays/timedeltas.py:767-794 \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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db8a914b50a1bf3b9d28f733e68b60e13b8accce88cfcc8313a869d3693b591"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): pandas/core/groupby/groupby.py:1199-1235 | pandas/core/groupby/groupby.py:1239-1275 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/groupby.py"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"863f6ef5d7342d9f56f20850eb17353b3be49a1f2390981032bd972a4589360a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): pandas/core/indexes/datetimes.py:2217-2266 | pandas/core/indexes/period.py:1027-1086 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimes.py"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbfaf65f79fb21ee7182a8561015555150fe2895220090a22463b3401685216"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): pandas/core/arrays/masked.py:1978-2057 | pandas/core/arrays/masked.py:2072-2151 \u2014 These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c215307e1cfcd3ec5f63756de510b14b6b8299eae844612d8117e0cc1e33036"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): pandas/io/xml.py:483-522 | pandas/io/xml.py:608-634 \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":"pandas/io/xml.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0db081058fe26c69b43ffc146420a3ebb9a418b8f43d92a00cc33e1daae241"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): pandas/core/groupby/groupby.py:3275-3357 | pandas/core/groupby/groupby.py:3363-3428 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/groupby.py"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"62af39dcb963089ef85fe0ba9e54bb1ec82c69bdeb4306d3bff04765629ddf95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (134 corresponding lines): pandas/io/pytables.py:1362-1495 | pandas/io/pytables.py:1594-1732 \u2014 These two members are one piece of code written twice and then edited apart: 134 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7885bbd8fe796562230ac530886788735df90a10ed56aad25473e1f17b331f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): pandas/core/indexes/datetimes.py:83-113 | pandas/core/indexes/timedeltas.py:71-91 \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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd3d835bdf18691e914dd3cc8bfc032535c410f9a8c04b4b44d096bbce95a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pandas/core/indexes/accessors.py:256-274 | pandas/core/indexes/accessors.py:277-293 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/accessors.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0868c77e7a88d4e4af02422f09dffab6ff4774b235c513569f44115e290b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): pandas/core/arrays/sparse/array.py:2161-2208 | pandas/core/arrays/sparse/array.py:2211-2256 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e92fcd94c233677d50d7ac70c6670a23561a45c2c4dcda48fcfb8c0e16a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pandas/core/arrays/_arrow_string_mixins.py:440-451 | pandas/core/arrays/_arrow_string_mixins.py:456-467 \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":"pandas/core/arrays/_arrow_string_mixins.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd661eaf9131c98b8c38c9317f8c003014ece9067c5e5ae47aed88d22b4d634"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): pandas/core/arrays/_mixins.py:452-501 | pandas/core/arrays/base.py:1456-1525 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/_mixins.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"671d57148182d930f299d2ce545190f5c5c7b0f275ea83e729fed38bc895bd1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): pandas/core/apply.py:1490-1512 | pandas/core/apply.py:1693-1716 \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":"pandas/core/apply.py"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1458491e89601fa21e242ab3c8e16e966f94dfcaaba3947843db8a05fd19d012"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): pandas/core/arrays/categorical.py:2729-2758 | pandas/core/arrays/categorical.py:2761-2790 \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":"pandas/core/arrays/categorical.py"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"b848559336e1ea8118953237c6a04f5f1874e2c2fb10b08e619cd7d62721f7e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pandas/core/indexes/interval.py:105-117 | pandas/core/indexes/interval.py:122-134 \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":"pandas/core/indexes/interval.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6964647e52968cfe3afa36cfee69e94318670319f3185314115d752ec0f38f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): pandas/io/formats/xml.py:536-573 | pandas/io/xml.py:660-688 \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":"pandas/io/formats/xml.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"754cedd82b98d38f79540ffe9462464857a7ce888182df666164dad73bc50649"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): pandas/core/arrays/base.py:1595-1659 | pandas/core/arrays/sparse/array.py:1308-1332 \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":"pandas/core/arrays/base.py"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"164e5a4d40137dc5c0eefc88d3accb005a71ce8442f2ef1a9759244245875f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): pandas/io/clipboard/__init__.py:174-201 | pandas/io/clipboard/__init__.py:205-228 | pandas/io/clipboard/__init__.py:514-530 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/clipboard/__init__.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a68e5e019b670d7a51d4ed6839974272e3fecf4c4547debde842992eb99723c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): pandas/io/sql/sqla.py:353-425 | pandas/io/sql/sqlite.py:375-402 \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":"pandas/io/sql/sqla.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34562b4ecbfad0b37cf7b481ca0b27a931a79075545f6ecd3415a2c9fba2bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): pandas/io/sql/sqla.py:439-477 | pandas/io/sql/sqlite.py:424-494 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/sql/sqla.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4359fbc3a5ed0354b1fbb6cc2f7aba254938d1153c0d630b567e8dfab56ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): pandas/core/series.py:3067-3156 | pandas/core/series.py:3164-3206 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3847f4df1f73e60bd6e0675dfb4fc130802a44ad5d2cd849e0c8e1c3d1e125"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): pandas/io/xml.py:525-544 | pandas/io/xml.py:637-655 \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":"pandas/io/xml.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b61f779c7c0b5fb2aebb1341d73d96c64059eaef0a1c8ac7e11e5fa3b39573"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): pandas/io/stata.py:2378-2410 | pandas/io/stata.py:3205-3243 \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":"pandas/io/stata.py"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"965d19e6178e560f1eb76bb000d85568ad8a169a7bbfbd387f8c8906b1376b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pandas/io/formats/format.py:673-696 | pandas/io/formats/format.py:699-714 \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":"pandas/io/formats/format.py"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00a01e85eaadae8c0ab2b43630007e49594f3ec69683d024ff930a806aa995f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pandas/core/apply.py:1515-1531 | pandas/core/apply.py:1719-1737 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/apply.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb05b77787c90b3eca6bd39cc022b6ccf721004eb9a2d5a0c45a1cba659a2f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pandas/core/apply.py:1925-1946 | pandas/core/apply.py:1951-1972 \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":"pandas/core/apply.py"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"5142beb244bc3460960516beb39f83a677726d3d0a2e0a36c242122a85550aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): pandas/core/_numba/kernels/mean_.py:174-198 | pandas/core/_numba/kernels/sum_.py:232-254 \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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cf301f617659b04084be8e08ee89c92dff58114f02c58af0e059ecd487e85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): pandas/io/formats/style.py:1364-1437 | pandas/io/formats/style.py:1654-1722 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style.py"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7828ab323b87be27b6571782b9906eb862e176088df4d0a5f033388c6de75705"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pandas/core/arrays/timedeltas.py:747-763 | pandas/core/arrays/timedeltas.py:798-812 \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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"386ee128a2aabab75b7fd94008d22d5f1ce1c561d1ffa3ce91ac489581a54a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (151 corresponding lines): pandas/core/generic.py:2170-2320 | pandas/io/formats/style.py:553-717 \u2014 These two members are one piece of code written twice and then edited apart: 151 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"185665ea1783a25d52c014e56d8ea2785f711f8cffc5e0cb26eb7e07fd0e00d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pandas/core/nanops.py:2084-2105 | pandas/core/nanops.py:2188-2205 \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":"pandas/core/nanops.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4394702598955152d2eb9f8a43b33c1a11a8e23263f92c80f4dd5cef00666d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 111\u002B corresponding lines): pandas/core/groupby/groupby.py:2822-2932 | pandas/core/groupby/groupby.py:3032-3146 | pandas/core/groupby/groupby.py:3157-3269 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 111 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b91c1dd8d97ee5f6c241694d7875f13e2936dd05dc4684394a3464ed9da660f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pandas/core/arrays/arrow/array.py:4294-4302 | pandas/core/arrays/arrow/array.py:4311-4321 \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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":4294}}}],"partialFingerprints":{"codehealthFindingId/v1":"823c2ac37705751241c887174cf30009202c55ee642e79e963686b8d25ef9354"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): pandas/io/parquet.py:58-94 | pandas/io/sql/sqla.py:120-148 \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":"pandas/io/parquet.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"25882414436e097457d4b82a586919c8c3221a71c4e98dda9d74fe07c86436bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): pandas/io/xml.py:460-480 | pandas/io/xml.py:576-605 \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":"pandas/io/xml.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c307bf508a15b73c19c47c5e3b820d4a5e719737effe87ed2d42262f85bb5ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): pandas/core/arrays/datetimelike.py:2413-2437 | pandas/core/arrays/numpy_.py:399-424 \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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43c3a47473314c519048a1117b0599e68e2cadd2d7ce33d83abc556e0f42080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pandas/io/stata.py:3681-3689 | pandas/io/stata.py:3705-3717 \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":"pandas/io/stata.py"},"region":{"startLine":3681}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e1bd14e9dd1c72a469a6f793b641ebbfd9163697e59e343bdf36c2fdb96724"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 97\u002B corresponding lines): pandas/core/groupby/groupby.py:2050-2146 | pandas/core/groupby/groupby.py:2256-2366 | pandas/core/groupby/groupby.py:2377-2479 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 97 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9b1370fa8c2301e0beabb3267a2e1db028bd044f1a8b6fe5c69517d89157ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): pandas/core/window/rolling.py:1657-1671 | pandas/core/window/rolling.py:1679-1693 | pandas/core/window/rolling.py:1701-1715 | pandas/core/window/rolling.py:1723-1737 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/window/rolling.py"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f004bb6e949ef89d20a1544f76552c65871bb7ec46e889084daa33525b98646d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): pandas/core/frame.py:10035-10122 | pandas/core/frame.py:10125-10184 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":10035}}}],"partialFingerprints":{"codehealthFindingId/v1":"df16b9561295555ac6f6affe71d6370fc9f53fc5a993eecb998d1f738c9a8f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): pandas/core/frame.py:19918-19997 | pandas/core/frame.py:20005-20074 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":19918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1907ed34718329c181a52d1d3066b48979d79e28d31eac54cf6a13d7365c692e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): pandas/core/nanops.py:679-725 | pandas/core/nanops.py:735-781 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/nanops.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"51411cd38b6a92b1e01beb855f20034e95939d69f894b1a1021012a93b0f817e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pandas/io/stata.py:1377-1386 | pandas/io/stata.py:1389-1398 \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":"pandas/io/stata.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabedba8b2ad51b5303bf53f4a254b336d8925eb9102c9c83adfdcbedec846f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pandas/core/arrays/arrow/array.py:1732-1743 | pandas/core/arrays/masked.py:540-547 \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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4df1572fc256b51b3e515dc97113d4857dba6fa40ec6d7bdbc3273cbeeea3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pandas/core/arrays/arrow/array.py:2580-2592 | pandas/core/arrays/arrow/array.py:2595-2603 \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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8785445154adf37cedc9ec7495291b2ee3428826b54dc933890525fcb89c114"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pandas/core/arrays/interval.py:876-890 | pandas/core/arrays/interval.py:893-907 \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":"pandas/core/arrays/interval.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dddea8ba89fc29afa9d8c062274e189152739e3db4bd84c32f96d1438ab0d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pandas/io/pytables.py:2723-2733 | pandas/io/pytables.py:3116-3128 \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":"pandas/io/pytables.py"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"db553f2bafdf98594b614126865a7d6dc0db65ec2f01dd5cff55765f742b94ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): pandas/core/array_algos/masked_reductions.py:215-219 | pandas/core/array_algos/masked_reductions.py:230-237 | pandas/core/array_algos/masked_reductions.py:248-255 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/array_algos/masked_reductions.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b70d5264617cac0dbbcd3ba54d3388d9feb06548906447e8bfb1c5bc1e053f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pandas/core/generic.py:1397-1408 | pandas/core/generic.py:1412-1420 \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":"pandas/core/generic.py"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aba10d53827f03f0281257841251b86e8f42855ae554c6f0cf915f9ab694112"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pandas/core/window/rolling.py:1767-1782 | pandas/core/window/rolling.py:1791-1802 \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":"pandas/core/window/rolling.py"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2d9892f4de63c582722cfb800a26cc8e0465f7b32cf90b204d7b2e8a09bc40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pandas/core/interchange/column.py:256-270 | pandas/core/interchange/dataframe.py:99-113 \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":"pandas/core/interchange/column.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bc767196542a4181fdecadd9db959c6b13ae0ddceab49031e4d005064e3eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): pandas/core/arrays/base.py:2220-2233 | pandas/core/arrays/base.py:2242-2256 \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":"pandas/core/arrays/base.py"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81e8406af7bb5911bcf45e4b896607de8b4d6c8e2434f065ca0a1dbb7d09d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): pandas/core/series.py:7226-7297 | pandas/core/series.py:7304-7361 \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":"pandas/core/series.py"},"region":{"startLine":7226}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d18762b5b5ad46744f03fe510048a29c862bee0789a21fb7bbdce095818c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): pandas/core/generic.py:11991-12003 | pandas/core/generic.py:12054-12068 | pandas/core/generic.py:12165-12185 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":11991}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a985c3c818c7062d22904f228c3ae318d4100c0291addcfe4343acf9c20560"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): pandas/core/arrays/_arrow_string_mixins.py:422-427 | pandas/core/arrays/_arrow_string_mixins.py:430-435 \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":"pandas/core/arrays/_arrow_string_mixins.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94554aa3ad9a4471896118cda159980411df5706bae17af311cec71ee32e5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): pandas/plotting/_matplotlib/core.py:1751-1756 | pandas/plotting/_matplotlib/hist.py:147-155 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d62b776d7ed317d1bb3067f7e091fb2edcbef89bede71f69b26e77f81c968e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pandas/core/arrays/datetimes.py:562-568 | pandas/core/arrays/timedeltas.py:347-356 \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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e71e8d4d22d3dbdee9f211246d6ff730e1f0b4a38a0c7d6bb604f324747518"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pandas/core/arrays/masked.py:1848-1860 | pandas/core/arrays/masked.py:1870-1882 \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":"pandas/core/arrays/masked.py"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eae4566af9f37de1b451e970cef1e3250a6f1a19081d8e43fc3005940e233bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): pandas/core/generic.py:9311-9368 | pandas/core/generic.py:9378-9451 \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":"pandas/core/generic.py"},"region":{"startLine":9311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bf50459a41f92906b649fdc2a54b95e670211191ffa212a03983012937b032"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pandas/core/arrays/arrow/array.py:3526-3535 | pandas/core/arrays/arrow/array.py:3539-3548 \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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce5efe78e3df1955ff8df954da57c8266b94b7cd90eb02d40397c3665b922ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): pandas/core/base.py:809-879 | pandas/core/base.py:884-954 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/base.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"4436f79d3ff83c14fba23fbf156a674d54ecf55ae453651008058f0286291ade"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (224 corresponding lines): pandas/core/frame.py:13646-13869 | pandas/core/series.py:2170-2397 \u2014 These two members are one piece of code written twice and then edited apart: 224 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":13646}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27286b6ccfb5d2de987c9093493114d7b27a9b402a30db5afe2adeeb0f44dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pandas/tseries/frequencies.py:420-431 | pandas/tseries/frequencies.py:434-445 \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":"pandas/tseries/frequencies.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cd4b25673b9cf853047ffeb9ab7ad44ab97504cabcb74b720f08e7672fddfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): pandas/core/_numba/kernels/mean_.py:34-49 | pandas/core/_numba/kernels/sum_.py:36-49 \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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e0b8c6391bc663895c7a14003589d5ad9137b9f25fb83f4720df2a0b040317"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (136 corresponding lines): pandas/io/formats/style.py:3164-3308 | pandas/io/formats/style.py:3321-3456 \u2014 These two members are one piece of code written twice and then edited apart: 136 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style.py"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfe5c725e22419be909ff805e768fec6041c56036e9f31fb420369f60a5e3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pandas/core/series.py:7453-7460 | pandas/core/indexes/base.py:7851-7857 \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":"pandas/core/series.py"},"region":{"startLine":7453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71d4b64ae0de512cdbe4c8c8685bdc18ab72f4cb376dbfd19159b533b69b709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pandas/core/arrays/datetimelike.py:1099-1112 | pandas/core/arrays/datetimelike.py:1116-1125 \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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b6f0c958818cb0d24d282302bdc7f9bc03480e7de2b2aa1bf143eb1703d392"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pandas/core/arrays/string_arrow.py:494-502 | pandas/core/arrays/string_arrow.py:540-549 \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":"pandas/core/arrays/string_arrow.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e183852d289aa835c66b35c965b96beb0fd8e23551561a26e127db921391a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): pandas/core/arrays/timedeltas.py:410-418 | pandas/core/arrays/numpy_.py:576-580 \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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"602627bc04381ec7addb8887a9d8b626e5b35bd305ccf65dbd465dcb56ac7716"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pandas/core/arrays/string_arrow.py:578-586 | pandas/core/arrays/string_arrow.py:589-596 \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":"pandas/core/arrays/string_arrow.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aac36bd50adc1272a9861313befdb572b301308db29cf16f83d33de5a64fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pandas/io/sql/adbc.py:77-108 | pandas/io/sql/sqlite.py:87-94 \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":"pandas/io/sql/adbc.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"198d39e87ab2021461ba551aa3f912b5b18551eccc3a92e522865c0324490fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): pandas/core/arrays/_mixins.py:119-121 | pandas/core/arrays/interval.py:699-701 \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":"pandas/core/arrays/_mixins.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c83cd4214ba959637c2183c12eaf3b69b13aa0a7d0591b586d7c75e3ff0740"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): pandas/core/arrays/_arrow_string_mixins.py:345-348 | pandas/core/strings/object_array.py:46-49 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/_arrow_string_mixins.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce96d41676d722af5cb5e531efc46e4066fc1a5d2644e3fdaaec9074050afec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pandas/core/_numba/kernels/mean_.py:56-64 | pandas/core/_numba/kernels/sum_.py:56-62 \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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dec67a897a7280dac9fd03a3667f6956c897b9cca814428ef3aab8aa2003a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): pandas/core/frame.py:7284-7421 | pandas/core/series.py:6148-6227 \u2014 These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":7284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7960f0e6c61ed39096e58d4941a53f68d18e6426839b0fc81c1fbb975dd62d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): pandas/io/excel/_pyxlsb.py:37-69 | pandas/io/excel/_xlrd.py:38-70 \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":"pandas/io/excel/_pyxlsb.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a05cc00b08a6097c01c2e801f3f9be52ac1cce26d40c7d9bb79ee72a2d3473"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (232 corresponding lines): pandas/core/frame.py:6582-6826 | pandas/core/series.py:5873-6104 \u2014 These two members are one piece of code written twice and then edited apart: 232 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":6582}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa95420399e8650017d438dcc632992b23be56e543cfee134f831cd6ddfecc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): pandas/core/arrays/base.py:1697-1749 | pandas/core/arrays/masked.py:1447-1499 \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":"pandas/core/arrays/base.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"276d25b2e7891b1c3c2e37501276ba3861eb62e169be7f84dd8bc176c4a508d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pandas/io/sql/adbc.py:64-73 | pandas/io/sql/base.py:219-230 \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":"pandas/io/sql/adbc.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b947f206558b5328f38ec72ff1a1a1e40d20306ed3e773690735849178a4ba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): pandas/core/groupby/generic.py:1371-1443 | pandas/core/groupby/groupby.py:5071-5152 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/generic.py"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ea461edcda1937fb98c5bc5ddee6d657356f6afa28002729fc808ad505ad51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): pandas/core/resample.py:348-453 | pandas/core/window/rolling.py:1234-1310 \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":"pandas/core/resample.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb433d011f0aa92ece6567d42c667e69dea7d206ccf2bb75a33854399e5cfb13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): pandas/core/indexes/datetimes.py:1071-1112 | pandas/core/indexes/interval.py:476-506 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimes.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15745452347ca87738561b72c95ae65b7ed410bbf4dc7c802c4d541f42e16a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): pandas/core/indexes/datetimes.py:1978-1979 | pandas/core/indexes/timedeltas.py:761-762 \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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adf651826e9d8f58c70235e39cafb825615745a38bc664cf2f01ccdb6dcfd0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): pandas/core/indexes/datetimes.py:338-339 | pandas/core/indexes/period.py:316-317 \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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7496f6774a87a4b527ba241c2624bd45c75c8f56cb0b1078270252dc9041be71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (507\u2013515 lines \u00D7 2): pandas/io/parsers/readers.py:1457-1971 | pandas/io/parsers/readers.py:2072-2578 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/io/parsers/readers.py:1457\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":"pandas/io/parsers/readers.py"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a44c3fc21f659f787c7c42fc4588a50d77419509b0b378682c366b2f0cd3280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (162\u2013163 lines \u00D7 2): pandas/core/generic.py:10646-10808 | pandas/core/generic.py:10821-10982 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/generic.py"},"region":{"startLine":10646}}}],"partialFingerprints":{"codehealthFindingId/v1":"86750f7d4ec0988c53081eeb1a832144c771124465d8d30b0d94b5de617062a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (92\u2013100 lines \u00D7 2): pandas/core/generic.py:7529-7620 | pandas/core/generic.py:7631-7730 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/generic.py"},"region":{"startLine":7529}}}],"partialFingerprints":{"codehealthFindingId/v1":"c965e2464440e25cda5c9517079630c6a33bf3232bbd94a804f49306a11c23c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (79 lines \u00D7 2): pandas/core/frame.py:19397-19475 | pandas/core/frame.py:19496-19574 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/core/frame.py:19397\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":"pandas/core/frame.py"},"region":{"startLine":19397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0443e6a76fe6d63947b283dd1cb5ee67d950897b9eb013fcc5f248907481d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68\u201370 lines \u00D7 2): pandas/core/window/ewm.py:826-895 | pandas/core/window/ewm.py:921-988 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/window/ewm.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"29392796f2bc072594ca71d08d5ea4e11640ac0dbe8f2546bdd0bf24430061e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201359 lines \u00D7 2): pandas/core/arrays/_mixins.py:452-486 | pandas/core/arrays/base.py:1456-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":"pandas/core/arrays/_mixins.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c48bdf6d3016165166349c23b0ee7636fa89d28547e2e70444987d86c76b68f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): pandas/core/groupby/numba_.py:72-110 | pandas/core/groupby/numba_.py:129-167 \u2014 both copies are in the same file, so extract the block 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 \u0060func\u0060 to \u0060Callable[..., Scalar]\u0060 in one and \u0060Callable[..., np.ndarray]\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":"pandas/core/groupby/numba_.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d98aa58b6f3b2dddf8fab712f7cd7b197c8ee9432f2fdb944570bd8b190558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): pandas/core/series.py:3067-3142 | pandas/core/series.py:3164-3200 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/series.py"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"95511bd30c71f3405f1a4863af1ba8e8b161238ec5e0afead04ff78ab2f51c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): pandas/core/nanops.py:1724-1758 | pandas/core/nanops.py:1785-1819 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/nanops.py"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"50810dc465e4d3212ce23cd2f041531479a8805c8ec5f86d07739520a6fd6241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): pandas/core/window/numba_.py:27-61 | pandas/core/window/numba_.py:182-216 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/core/window/numba_.py:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060func\u0060 to \u0060Callable[..., Scalar]\u0060 in one and \u0060Callable[..., np.ndarray]\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":"pandas/core/window/numba_.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2817c17c09f45b693652b2fcba1a494f7eecbb071cd1d28162e689ce4ddde1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): pandas/io/formats/style_render.py:1448-1482 | pandas/io/formats/style_render.py:1750-1784 \u2014 both copies are in the same file, so extract the block 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":"pandas/io/formats/style_render.py"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"611b881da7b98e53e85e70e9288e5eb6aaca845ab979cd938f7151e8b8607739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): pandas/core/window/numba_.py:88-119 | pandas/core/window/numba_.py:270-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060pandas/core/window/numba_.py:120\u0060 calls \u0060empty\u0060 and \u0060pandas/core/window/numba_.py:302\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":"pandas/core/window/numba_.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c4c91c6d067f69041ab7d15a6f20af6894eab25431920b35d2f42251e1f84d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 2): pandas/io/stata.py:3066-3094 | pandas/io/stata.py:3613-3637 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/io/stata.py:3066\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":"pandas/io/stata.py"},"region":{"startLine":3066}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09fccbd835ff65b446e0c427ca91dfad22a9ca7c81ad67791102a793a030272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): pandas/core/indexes/base.py:1303-1330 | pandas/core/indexes/range.py:1635-1662 \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":"pandas/core/indexes/base.py"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a768307968475a3dd9f7fbb129e3997456bc5e8617ee3d0c1d574f1c591331e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201326 lines \u00D7 2): pandas/core/arrays/arrow/array.py:1262-1287 | pandas/core/arrays/base.py:3118-3136 \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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"56175efc8d276a74d653e63b77972d05f73cd99242cc3ab05c4b83a05136505f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): pandas/core/window/rolling.py:1921-1943 | pandas/core/window/rolling.py:1961-1983 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/window/rolling.py"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"887c4d266cf936c6b5e8709e8515ea2b88272224142934f819e8775d1e7157b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): pandas/core/_numba/kernels/mean_.py:82-103 | pandas/core/_numba/kernels/var_.py:91-112 \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 \u0060pandas/core/_numba/kernels/mean_.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060pandas/core/_numba/kernels/var_.py:90\u0060 calls \u0060max\u0060 and \u0060pandas/core/_numba/kernels/mean_.py:80\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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6982e7fabad8f7fcde288f4e6180cf326a28f539c6fab2d5ac1915f5edcde047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): pandas/core/generic.py:2297-2318 | pandas/io/formats/style.py:695-716 \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 \u0060pandas/core/generic.py:2297\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":"pandas/core/generic.py"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee35b3ff8d2b98b89de9aaa79acf813f82c1cbfa1b3e699852f38c2f5b1e6d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): pandas/core/arrays/datetimelike.py:1372-1391 | pandas/core/arrays/datetimelike.py:1447-1460 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/core/arrays/datetimelike.py:1372\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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1685ccd3eccf5ac238218884e321a2ba50a3344f50429f83bc4aab04ef73a386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 6): pandas/core/arrays/arrow/array.py:1276-1292 | pandas/core/arrays/base.py:3125-3141 | pandas/core/arrays/categorical.py:1989-2007 | pandas/core/arrays/masked.py:902-919 | pandas/core/arrays/numpy_.py:268-286 | pandas/core/indexes/base.py:990-1007 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060method\u0060 to \u0060str\u0060 in one and \u0060str_t\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060pandas/core/arrays/masked.py:898\u0060 calls \u0060isinstance\u0060 and \u0060pandas/core/arrays/numpy_.py:266\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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d478a57a91a3e3583357e664b6587a45a2b66b58d3bfa49d9596d7b3b980d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): pandas/core/arrays/datetimelike.py:2420-2437 | pandas/core/arrays/numpy_.py:406-424 \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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a755fae62dc9182473a6dd07e96966fba178107210c614eec68d8a4d9ca29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): pandas/core/frame.py:1196-1213 | pandas/core/frame.py:3415-3433 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/frame.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9171fe0948f3df1c3c8f9be4e8841accb12cce26a42ae7228b44af603b27424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): pandas/core/reshape/merge.py:1772-1790 | pandas/core/reshape/merge.py:1794-1812 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9873143c4f5f4f3c8957db342218a13b57c7da5cd795e84aad7cb9777ad59a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): pandas/core/groupby/generic.py:4222-4237 | pandas/io/excel/_base.py:818-833 | pandas/io/excel/_base.py:1918-1933 | pandas/plotting/_core.py:264-279 | pandas/plotting/_matplotlib/hist.py:596-611 \u2014 there are 5 copies across 4 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 \u0060pandas/core/groupby/generic.py:4222\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":"pandas/core/groupby/generic.py"},"region":{"startLine":4222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c92f95fde3e3f1e9097eedd6bc61ddaaf3bf059fec38fa9096f5682243fe048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pandas/core/_numba/kernels/mean_.py:174-189 | pandas/core/_numba/kernels/sum_.py:234-249 \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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c0e72116f06eb8eb07c416f26e4cc034f48c3121fac034543335dd599e2999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pandas/core/nanops.py:2087-2102 | pandas/core/nanops.py:2188-2203 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/nanops.py"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aefc47a8be1fba072062e9b7da677528379ec76f39f3f9ea6c6409db262493"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): pandas/io/excel/_openpyxl.py:537-551 | pandas/io/excel/_openpyxl.py:605-620 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/io/excel/_openpyxl.py:605\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":"pandas/io/excel/_openpyxl.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cf6bceb9f7dce091b55315d0c1cb7f6b44442d9f8926bc8d41eaf7caa05db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8): pandas/core/frame.py:1199-1213 | pandas/core/frame.py:3419-3433 | pandas/core/frame.py:3704-3718 | pandas/core/generic.py:4074-4088 | pandas/io/excel/_base.py:544-558 | pandas/io/html.py:1281-1295 | pandas/io/json/_json.py:1001-1015 | pandas/io/xml.py:1216-1230 \u2014 there are 8 copies across 6 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 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pandas/core/frame.py:1199\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":"pandas/core/frame.py"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ca943d5fd45ebba9dd9b3d8163e6d59fd274ae1cc52ce731c49ff23e3763d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): pandas/core/_numba/kernels/mean_.py:88-102 | pandas/core/_numba/kernels/sum_.py:92-106 | pandas/core/_numba/kernels/var_.py:97-111 \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 \u0060pandas/core/_numba/kernels/mean_.py:88\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060sum_x\u0060 to \u0060float\u0060 in one and \u0060Any\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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d930f0552a9d315582a21c0a2dced751f6088416515bd699b9657799ec07bce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pandas/core/frame.py:19477-19491 | pandas/core/frame.py:19576-19590 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/core/frame.py:19477\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":"pandas/core/frame.py"},"region":{"startLine":19477}}}],"partialFingerprints":{"codehealthFindingId/v1":"981047bb628abda98b93b32271e9bf89098f19b4e66234c333ab05a713e16864"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): pandas/io/formats/xml.py:379-393 | pandas/io/formats/xml.py:477-489 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/io/formats/xml.py:379\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 first that the copies are not typed on the same thing: \u0060SubElement\u0060 names \u0060lxml.etree\u0060 in one and \u0060xml.etree.ElementTree\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/xml.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"78857bf9ba0f6acf513fa81fd641b6bef7eb4e4a72af8ca213a27538b21b3e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pandas/io/sql/adbc.py:137-151 | pandas/io/sql/sqlite.py:295-309 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: \u0060Error\u0060 names \u0060adbc_driver_manager\u0060 in one and \u0060sqlite3\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/sql/adbc.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b497637b5700c7aef8632b2ea19641aaf2eeeaa4d321015c3b0607e934635c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pandas/plotting/_matplotlib/core.py:2240-2254 | pandas/plotting/_matplotlib/core.py:2282-2296 \u2014 both copies are in the same file, so extract the block 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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c9dc6d1247dd993dba53410ea8efb4f76532af6d6c6a7feaef3a032bfe200c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): pandas/core/arrays/arrow/array.py:1621-1633 | pandas/core/arrays/string_.py:420-433 \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 \u0060pandas/core/arrays/arrow/array.py:1621\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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3d28a58920892f3b61419762b17645b80a0f6abf37d1124906580efb04d6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pandas/core/arrays/datetimes.py:1397-1410 | pandas/core/arrays/datetimes.py:1481-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. 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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d729482cc340ec21dc07f3ef085c14d2056e3128927cb9147fb03c75df444103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pandas/core/groupby/groupby.py:3344-3357 | pandas/core/groupby/groupby.py:3415-3428 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/groupby/groupby.py"},"region":{"startLine":3344}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfe2b3a949acbfe69bc71f92c19024208b5f412634aa0c53b5953e0aed7eebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): pandas/core/reshape/merge.py:1097-1110 | pandas/core/reshape/merge.py:1112-1124 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/reshape/merge.py"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e1c4dc98e063bfd479fc78e29360543ec668464844ba663de6e2cc2cfc146d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pandas/tseries/frequencies.py:588-601 | pandas/tseries/frequencies.py:650-663 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/tseries/frequencies.py:588\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":"pandas/tseries/frequencies.py"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb394d652bd669ac0e093aba62ce137b4c2c2fb382b7fd7ecf390f5088f259ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pandas/core/arrays/masked.py:1004-1016 | pandas/core/arrays/sparse/array.py:2993-3005 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: \u0060ExtensionArray\u0060 names \u0060pandas.core.arrays\u0060 in one and \u0060pandas.core.arrays.base\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff67bff3a57d1438833a8e1eda963337a6a3481e0763b8bca6b4abf7ba713cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): pandas/core/arrays/masked.py:1130-1141 | pandas/core/arrays/sparse/array.py:2948-2960 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: \u0060ExtensionArray\u0060 names \u0060pandas.core.arrays\u0060 in one and \u0060pandas.core.arrays.base\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a74495d3afd68f03938d4a0ba0175b440178b3fef81258f5c4f85b613632d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pandas/core/internals/blocks.py:1920-1932 | pandas/core/internals/blocks.py:1998-2010 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/core/internals/blocks.py:1920\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":"pandas/core/internals/blocks.py"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee89de62c63f9cfa6ea32ca6f13e79d2f49ba2805d376148a48c17335e1a0b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pandas/core/window/ewm.py:606-618 | pandas/core/window/ewm.py:697-709 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/core/window/ewm.py:606\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":"pandas/core/window/ewm.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f445fbbc03d72a567ecd5e7a1a9a8b8131bb975ba27cc52c7d5f82f8efeefe58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): pandas/io/formats/style.py:4403-4415 | pandas/io/formats/style.py:4416-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pandas/io/formats/style.py:4403\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":"pandas/io/formats/style.py"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8e3e57186d3d1e9596995db782183bd9f0564650f2c0f9ada5de89639c2213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pandas/io/formats/xml.py:417-429 | pandas/io/formats/xml.py:515-527 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060pandas/io/formats/xml.py:414\u0060 calls \u0060items\u0060, \u0060isinstance\u0060, \u0060register_namespace\u0060 and \u0060pandas/io/formats/xml.py:514\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":"pandas/io/formats/xml.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee826fe9a62645d5b09b761040756c068745381853f244760b2a28d723b7ebeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): web/pandas_web.py:226-238 | web/pandas_web.py:345-357 \u2014 both copies are in the same file, so extract the block 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 \u0060web/pandas_web.py:226\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":"web/pandas_web.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3bd807fcc152178c60f0ea4a233702f8a9959028b230bfde40f9cb5a973a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): pandas/core/internals/blocks.py:1372-1382 | pandas/core/internals/blocks.py:1923-1934 | pandas/core/internals/blocks.py:2001-2012 \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 \u0060pandas/core/internals/blocks.py:1372\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":"pandas/core/internals/blocks.py"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4bbe53cd0ca85009c7d0426e05f1a3385c6a214598656760049e2d8852cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pandas/core/arrays/datetimelike.py:953-964 | pandas/core/arrays/interval.py:743-754 \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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fa46023accbf6af35533fea4b3f5e531cdef6a40fd7ac05f04433760f117fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pandas/core/arrays/interval.py:876-887 | pandas/core/arrays/interval.py:893-904 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/arrays/interval.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5138e7407cb10c7cee1f1f9388e694f42aa46f115e7390b88853ce2a90da1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pandas/core/groupby/generic.py:3106-3117 | pandas/core/groupby/generic.py:3122-3133 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/core/groupby/generic.py:3106\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/generic.py"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"566bdc7705ae74b9f4c1f2f32dda2ab2b1542a43bf600f1bb804dc73e942aec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pandas/core/groupby/ops.py:944-955 | pandas/core/groupby/ops.py:1011-1022 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/ops.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7a8cd6ce1167b8e57a66dba2b194404a3a1a608d52d126e19759cea360f16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): pandas/core/indexes/datetimes.py:102-113 | pandas/core/indexes/timedeltas.py:83-91 \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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae63fadabc38cc6eec6bc4486801ae168313ef80e7f54e055ec750731bb7fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pandas/core/nanops.py:829-840 | pandas/core/nanops.py:1877-1888 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/nanops.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"14233f6322cc960cc4a659cb35a9ec1de3e1d4efb77c1600e2a0fac543fab98f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): pandas/core/reshape/concat.py:752-761 | pandas/core/reshape/concat.py:803-814 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/reshape/concat.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"04152e6d2ed4a0987d0d8a43ca9869f000020e7a075a2106cccde77ddd27dd12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pandas/io/stata.py:2399-2410 | pandas/io/stata.py:3232-3243 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/io/stata.py:2399\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":"pandas/io/stata.py"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"08050c7ef4f44cd4daf4f083ef9bc2471e74fe87a8eed9163de85cc3304cf153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): pandas/core/_numba/kernels/sum_.py:171-187 | pandas/core/_numba/kernels/var_.py:181-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":"pandas/core/_numba/kernels/sum_.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d615723f308a7be742f6ce33b46ee56ef7aaa7b273cdfb87d53ffc0e30d1afe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): pandas/core/arrays/base.py:1650-1659 | pandas/core/arrays/sparse/array.py:1322-1332 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/base.py"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"70eb0a60044c1401ff3bf3a836e1a0585d7031264f5f5d971d7f90e8465eb997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pandas/core/internals/blocks.py:1311-1321 | pandas/core/internals/blocks.py:2005-2015 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/internals/blocks.py"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d12999322df2858922dadf166122efb6a0ea7aabae8150969f0e6d768e7d208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pandas/core/window/ewm.py:594-604 | pandas/core/window/ewm.py:685-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pandas/core/window/ewm.py:594\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":"pandas/core/window/ewm.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"16677b4cccb28c9be5c1dd62844fe68347feafb51e134e262fa32fd9235435c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): doc/sphinxext/announce.py:92-101 | doc/sphinxext/announce.py:103-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":"doc/sphinxext/announce.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77b6bea713b3d5d0d0b9eb0a30736f82eb5635ecdb54e16b0ad63f3fbe40d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pandas/core/arrays/timedeltas.py:717-726 | pandas/core/arrays/timedeltas.py:768-777 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0ed435de030092403b633098e71088633db24227e954b53890c7482f102a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pandas/core/computation/expr.py:476-485 | pandas/core/computation/expr.py:486-495 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/computation/expr.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc486db5bb3af7f8485e408599b21f5f144a93a82bd142ed1ddd19d953af762e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pandas/core/reshape/merge.py:2142-2151 | pandas/core/reshape/merge.py:2154-2163 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/reshape/merge.py"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"890bada01a6484994219162e393255aefbf5265941c02944f1f0e7d4125ffd4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): pandas/plotting/_matplotlib/converter.py:923-932 | pandas/plotting/_matplotlib/converter.py:997-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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"437e531c30c62b6f85981cba38abc1844bc82b1d57d837835636c0e6a40fe3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pandas/core/array_algos/take.py:282-290 | pandas/core/array_algos/take.py:296-304 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/array_algos/take.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"725b1ec3e196ca234c7294ac0fde3316fc5701bfadcba037d3c10ed38cf54cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): pandas/tseries/frequencies.py:570-578 | pandas/tseries/frequencies.py:633-640 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/tseries/frequencies.py:570\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":"pandas/tseries/frequencies.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c10ff5e7df68e32149005657488a3c9d199dfd48b777bb876692cd18f75802a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pandas/core/arrays/categorical.py:2745-2752 | pandas/core/arrays/categorical.py:2777-2784 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/arrays/categorical.py"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"031416fca80c21081cb287245e1f9df3a24ddba1a88e44ef84f83941ee0312c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pandas/core/indexes/range.py:1363-1370 | pandas/core/indexes/range.py:1378-1385 \u2014 both copies are in the same file, so extract the block 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":"pandas/core/indexes/range.py"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a390492d5bb661293878932d05d0d155ce1177f7e242df1af2228911edf8843b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): pandas/core/reshape/merge.py:1753-1760 | pandas/core/reshape/merge.py:1762-1767 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/core/reshape/merge.py:1753\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":"pandas/core/reshape/merge.py"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e688dc7cf856bdb451450acc0892c36a19a65c146a4a8daa8f3039c43fa7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): pandas/core/window/numba_.py:310-316 | pandas/core/window/online.py:62-69 \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":"pandas/core/window/numba_.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fbd4ee03fd904233623542301c612c4bb9123f158d6d753b314263ebd3e1b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pandas/io/excel/_openpyxl.py:767-775 | pandas/io/excel/_pyxlsb.py:141-148 \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":"pandas/io/excel/_openpyxl.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"002c2040df171e5ecde7c336d56f80979fea412fa0a80c07b8a1f836d43a16b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pandas/io/formats/style_render.py:593-600 | pandas/io/formats/style_render.py:861-868 \u2014 both copies are in the same file, so extract the block 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 \u0060pandas/io/formats/style_render.py:593\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":"pandas/io/formats/style_render.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38f86f6ac4c7f356cffc95b8118c4b7653e66db705a060ba5e4009356ebe0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pandas/plotting/_matplotlib/converter.py:1000-1007 | pandas/plotting/_matplotlib/converter.py:1049-1056 \u2014 both copies are in the same file, so extract the block 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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"c146671f855cc1481479ee33ce0b4799c04b4e74b5a412007f731aafa7c1a23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): pandas/core/strings/accessor.py:941-947 | pandas/core/strings/accessor.py:1078-1084 | pandas/core/strings/accessor.py:1170-1176 | pandas/core/strings/accessor.py:1262-1268 \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":"pandas/core/strings/accessor.py"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9522f6c1ce9c7a170dc11da9c232c15678583cd9ee26255ed39eee0bb0ca35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pandas/plotting/_matplotlib/misc.py:277-283 | pandas/plotting/_matplotlib/misc.py:405-411 \u2014 both copies are in the same file, so extract the block 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, \u0060pandas/plotting/_matplotlib/misc.py:276\u0060 calls \u0060f\u0060 and \u0060pandas/plotting/_matplotlib/misc.py:404\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":"pandas/plotting/_matplotlib/misc.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"da927d0f6c639d7cebeeba243944062950462cb613d7f054e422a56a75eb46a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): pandas/plotting/_matplotlib/converter.py:927-933 | pandas/plotting/_matplotlib/converter.py:1000-1005 | pandas/plotting/_matplotlib/converter.py:1049-1054 \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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d766b46dfa8c1e84dcd4b293801812982572a7e9feca2b0ea7cc8a79f9be9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): pandas/core/nanops.py:1352-1357 | pandas/core/nanops.py:1754-1759 | pandas/core/nanops.py:1815-1820 \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":"pandas/core/nanops.py"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac290b82ae12ef8a707df0b88e19bc9d7bbec51b867cafa9bccb26edc520f799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pandas/core/reshape/merge.py:629-633 | pandas/core/reshape/merge.py:636-641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pandas/core/reshape/merge.py:636\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":"pandas/core/reshape/merge.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e437a6cc3a0885038a2020b3e29064518300209fcadd0e33aae0fafc12e87ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): pandas/io/stata.py:224-230 | pandas/io/stata.py:232-236 | pandas/io/stata.py:237-242 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdb1e833fb44850910d322af022b495a5322bb80531e74ec452a7495ebae3f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pandas/core/arrays/base.py:629-634 | pandas/core/dtypes/base.py:179-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/base.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f340d7c63f134d6d10f455b5532c891951b34897222e88ef340dcad519257f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pandas/core/arrays/numpy_.py:560-564 | pandas/core/arrays/timedeltas.py:430-435 \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":"pandas/core/arrays/numpy_.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf2091c905be87767c766b0fbe16cac7f15e6a25ec3462a23cdcf0ac254f64d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (107 lines \u00D7 2): pandas/core/frame.py:9502-9608 | pandas/core/series.py:4368-4508 \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":"pandas/core/frame.py"},"region":{"startLine":9502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed64caaafd12ccd2e3ef962a179d48ca9fc69ff2ae81decf0472e8ab41b0f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pandas/core/groupby/groupby.py:881-888 | pandas/core/window/rolling.py:304-311 \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":"pandas/core/groupby/groupby.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11d9602b8abd1e0730ea15de21fef4ece3703e1a2bd7a07c8c6964c6d31c56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): pandas/core/indexes/datetimes.py:976-1019 | pandas/core/indexes/timedeltas.py:623-662 \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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffc9ce97a47da7c4c870f739fd00a0ded85d10d8db5c0cfd84cf647792e5cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): pandas/core/indexes/datetimes.py:1025-1068 | pandas/core/indexes/period.py:281-313 \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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"022bcaebb3d5c6f1577f500724303ce3d8de2bb36b6f1c9aec53d00e182a77ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (74 lines \u00D7 2): pandas/core/window/expanding.py:263-336 | pandas/core/window/rolling.py:2216-2321 \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":"pandas/core/window/expanding.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"381868d4958e8ecb1da5740ce474196b1154455b4c681cd12463d4f3c01ba694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pandas/core/arrays/_mixins.py:653-665 | pandas/core/arrays/categorical.py:2155-2170 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060dtype\u0060 to \u0060ExtensionDtype\u0060 in one and \u0060CategoricalDtype\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":"pandas/core/arrays/_mixins.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"1940cc09f34d3690b936f2d4531ee8ff801b1794ec922a0ae32190f311c8643d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pandas/io/sql/sqla.py:652-661 | pandas/io/sql/sqlite.py:530-539 \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":"pandas/io/sql/sqla.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a418d1aa706bb7a09d24853f0ea4ca405b6cf52c806ab6fb5612e31d666d7d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pandas/io/xml.py:277-283 | pandas/io/xml.py:402-408 \u2014 both copies are in the same file, so extract the block 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":"pandas/io/xml.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aad8b375163f526be29a9aab2e7c4ccb1d0e9de3533182b1e80f5cad4cd4fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): scripts/check_for_inconsistent_pandas_namespace.py:121-135 | scripts/sort_whatsnew_note.py:66-78 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_for_inconsistent_pandas_namespace.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c33285fdad8b7a020ad054c74aa6612b535bbfac4172ce987db8346987dbb9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DataFrame (LCOM4 60): DataFrame\u0027s methods fall into 60 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 60 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":"pandas/core/frame.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e70cab3cd13f32f200980bc111e49a74a5ffee05dc609b620358f95e480ff08"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Series (LCOM4 20): Series\u0027s methods fall into 20 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 20 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":"pandas/core/series.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa5c0abf8b3ddf039344a7fb328c9844cc4a15886061ecc213c3d963e95b8c5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NDFrame (LCOM4 19): NDFrame\u0027s methods fall into 19 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 19 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":"pandas/core/generic.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a85ac3dd4a52f87e1bf583391c2172a5b86c07b04d678edb9f2c14dfb3d315"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExtensionArray (LCOM4 10): ExtensionArray\u0027s methods fall into 10 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 10 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":"pandas/core/arrays/base.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53d784056d13b0ee4e1ab7ea15c631b3faa77ddbeef579823825fd163e70f5f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TimedeltaArray (LCOM4 10): TimedeltaArray\u0027s methods fall into 10 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 10 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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe65a399f0887340ecf653776e1d06725a2ed38089ebfb337a023790a9e417f5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PeriodArray (LCOM4 9): PeriodArray\u0027s methods fall into 9 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 9 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":"pandas/core/arrays/period.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a7844c9b51abb3ec6ac352642348d7387889b4766e757cf427c6708081b93a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IntervalIndex (LCOM4 9): IntervalIndex\u0027s methods fall into 9 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 9 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":"pandas/core/indexes/interval.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa57cb2ebb3838ad7d11ca21bbd88fe77cea35c8695063e076e736e516add77"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExtensionDtype (LCOM4 4): ExtensionDtype\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/base.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"15de78bd8d203972c03a180d660f551ac2c2fc8f5da38b2537a8f3a7d3104110"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DatetimeIndex (LCOM4 4): DatetimeIndex\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimes.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0908e9ce32c32539feccd17f059c1f501422c7a6b76f28caf6265505ceb3b15e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExcelWriter (LCOM4 4): ExcelWriter\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/excel/_base.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05a6fdc760955b32ad777f09038ff82b91e3901becbdf22a2b3d68a363d6877"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _TableBuilderVerboseMixin (LCOM4 4): _TableBuilderVerboseMixin\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/info.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eb65064d0a3eadc7b97de9d8adee39fd09c49cfc690a6fbb25c115725a5df8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GenericFixed (LCOM4 4): GenericFixed\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":3570}}}],"partialFingerprints":{"codehealthFindingId/v1":"390406d93e3006fdb846f1cedeaf28c1ecd04259091ddd972b2a859b8be07750"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/frame.py: pandas/core/frame.py changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in DataFrame._reduce at line 17063. 36 of those changes were fix/bug commits, and the other 40 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/frame.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":"pandas/core/frame.py"},"region":{"startLine":17063}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3457e00ba714bd15a55537db11b4c79f299342ab096feff78ede23aa32b3d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/parsers/readers.py: pandas/io/parsers/readers.py changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in readers._read_csv_chunks at line 840. 15 of those changes were fix/bug commits, and the other 17 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/parsers/readers.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":"pandas/io/parsers/readers.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"d252554734e4fd2d1b7b2b454cf659f1a0413922abb54adb52ccc02cc30e423a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/generic.py: pandas/core/generic.py changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in NDFrame._where at line 10411. 18 of those changes were fix/bug commits, and the other 29 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/generic.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":"pandas/core/generic.py"},"region":{"startLine":10411}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aa42fdc45cd2d105644a811afa1342ce1ff47eb045c90905cf1bea1e64a965"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/arrays/arrow/array.py: pandas/core/arrays/arrow/array.py changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ArrowExtensionArray._evaluate_op_method at line 1462. 35 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/arrow/array.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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1a93a1ba74f7e3054e98f196db8ee5439c54ea1d761414e7ed2cd3b031b56d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/indexes/base.py: pandas/core/indexes/base.py changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Index.join at line 4590. 18 of those changes were fix/bug commits, and the other 19 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/indexes/base.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":"pandas/core/indexes/base.py"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc646258331e8d9c273d44d04441088e2b33a395354a39d6f4f2094aa916bb2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/arrays/sparse/array.py: pandas/core/arrays/sparse/array.py changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SparseArray.__init__ at line 652. 41 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/sparse/array.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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a29a6a4c71ed2dfc25c059d6227b78721d88f0992c30fbd37a76097ec2a391e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/indexes/multi.py: pandas/core/indexes/multi.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in MultiIndex._get_locs at line 4223. 14 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/indexes/multi.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":"pandas/core/indexes/multi.py"},"region":{"startLine":4223}}}],"partialFingerprints":{"codehealthFindingId/v1":"950932d2c6d25664d9a248a360729116ccf4b8b57e3f245f13f4f85e111e2564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/pytables.py: pandas/io/pytables.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Table._create_axes at line 4821. 15 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/pytables.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":"pandas/io/pytables.py"},"region":{"startLine":4821}}}],"partialFingerprints":{"codehealthFindingId/v1":"0424e4730b73e5870e53ae858be72116ecb63e2def7ea895f6e545f7c63c7cd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/common.py: pandas/io/common.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in common.get_handle at line 769. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/common.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":"pandas/io/common.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9100d227ea84910a4f63a1be93612c4161089816ec7abae9dc80b92b33bf390"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/plotting/_matplotlib/core.py: pandas/plotting/_matplotlib/core.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MPLPlot.__init__ at line 152. 19 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/plotting/_matplotlib/core.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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"16608f5305ec6da86a4fa4b6a3f0139026f6a502a96ec035daf2fc88ee31f7a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/_testing/asserters.py: pandas/_testing/asserters.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in asserters.assert_series_equal at line 1039. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/_testing/asserters.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":"pandas/_testing/asserters.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f26b25eed2f47e543a9873c4032cc70b813be647a0bdf54b67737b0a255b09f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/indexing.py: pandas/core/indexing.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _iLocIndexer._setitem_with_indexer_split_path at line 2773. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/indexing.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":"pandas/core/indexing.py"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a137ac7907f0448059e34a4d97538dfbbb2d3fe08293e1d3de999da08996015"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/resample.py: pandas/core/resample.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in TimeGrouper.__init__ at line 2459. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/resample.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":"pandas/core/resample.py"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ffb715bfb239e02f4e521b24c25d35347e7ad6dacfb4cfd35ed906aff6ab27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/formats/style.py: pandas/io/formats/style.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Styler.to_latex at line 763. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/formats/style.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":"pandas/io/formats/style.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1593caccc9d3b4ac0684414e4cb96d351220e8201df8f13bbb6708c4b13f279"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/stata.py: pandas/io/stata.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in StataReader.read at line 1663. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/stata.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":"pandas/io/stata.py"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ed12bd65d1573d94b74ef015622299eca0f6fa0d102fec2c2c326e3e1a638c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/parsers/python_parser.py: pandas/io/parsers/python_parser.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in PythonParser._infer_columns at line 618. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/parsers/python_parser.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":"pandas/io/parsers/python_parser.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d83b24f31518edeb48e6fd916e24bf9cf52bc8bc0a80c9d8cda1291404d8cec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/json/_json.py: pandas/io/json/_json.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in _json.to_json at line 158. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/json/_json.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":"pandas/io/json/_json.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cca7308355ac7be6cbe0fe66cc9b0a7f1b4b13d5448d59aa1a982d387d24060"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/internals/blocks.py: pandas/core/internals/blocks.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Block.replace_list at line 832. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/internals/blocks.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":"pandas/core/internals/blocks.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b9d24d7a661dd598a1e9017992a444df127ec52a02cb0c22c9a7f41b618dcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/computation/eval.py: pandas/core/computation/eval.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in eval.eval at line 205. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/computation/eval.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":"pandas/core/computation/eval.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44ff3ae27b30fa86e4ea48cddf9e53f99d5382c53c4ff96c980fdc4083a58ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/groupby/generic.py: pandas/core/groupby/generic.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SeriesGroupBy.value_counts at line 1047. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/groupby/generic.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":"pandas/core/groupby/generic.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0f554d3e6c752402b1174e791eb287c9c48aa34571503c4f9787fbc3790678"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/arrays/datetimes.py: pandas/core/arrays/datetimes.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in datetimes._generate_range at line 3178. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/datetimes.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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fc5271db01fa58392d70c48e5768c4f499346376fbdb9845cf0324540480e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/internals/managers.py: pandas/core/internals/managers.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BlockManager.iset at line 1305. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/internals/managers.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":"pandas/core/internals/managers.py"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed7a8d3b6faf78083bb931446b69b4ab72cb385defb25f6de05e4276ace8364"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/apply.py: pandas/core/apply.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in apply.reconstruct_func at line 2015. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/apply.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":"pandas/core/apply.py"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18e8fb1a161a91af80882e547313f07f4f3c2c13a00ab52ad43e9c5d65b50b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/groupby/ops.py: pandas/core/groupby/ops.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in WrappedCythonOp._call_cython_op at line 389. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/groupby/ops.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":"pandas/core/groupby/ops.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bf333a5ff00aba9b97f664811b0dbec0f0709ca693695b669e631d4a0715fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/tools/datetimes.py: pandas/core/tools/datetimes.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in datetimes.to_datetime at line 849. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/tools/datetimes.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":"pandas/core/tools/datetimes.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff91f745b419df0ae76b8d5e5ffe42723aaa401c6c10ddba520aa273a860c04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/arrays/timedeltas.py: pandas/core/arrays/timedeltas.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in timedeltas.sequence_to_td64ns at line 1223. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/timedeltas.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":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c297b0227fef0f5278f0d80c2407ca156e1908ddea15ad48bc2d27c7f1e3fa0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/excel/_base.py: pandas/io/excel/_base.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in BaseExcelReader._parse_sheet at line 843. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/excel/_base.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":"pandas/io/excel/_base.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a8baf7033a694eca1828f0dfd0c27a48c81c81f53b057e8333952ae6843268"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/tools/numeric.py: pandas/core/tools/numeric.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in numeric.to_numeric at line 52. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/tools/numeric.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":"pandas/core/tools/numeric.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23ff0761338000d18334c952b86d6e74d7a6b3da4028e0c0441a4e1efb981e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/internals/construction.py: pandas/core/internals/construction.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in construction.ndarray_to_mgr 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/internals/construction.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":"pandas/core/internals/construction.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f535fbb6285a2d9caff98640963d1c49ad036522b60e64fa3d5bb7b36b885c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/parsers/base_parser.py: pandas/io/parsers/base_parser.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ParserBase._infer_types at line 526. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/parsers/base_parser.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":"pandas/io/parsers/base_parser.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"0457e626ad3c310e62495da0fe7e2fdffa74443bb73fa1a26c67c3fde3808acf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/construction.py: pandas/core/construction.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in construction.array at line 86. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/construction.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":"pandas/core/construction.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"518511c8d7efc24d4c39c3d9f9dd1f35a3ed76fceaba148c8c4e2366f9edbdb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/_util.py: pandas/io/_util.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _util._post_convert_dtypes at line 167. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/_util.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":"pandas/io/_util.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a1f2450658dddc4d0e978e92545f936425610ae6ab013a35c5f3129573fff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/reshape/encoding.py: pandas/core/reshape/encoding.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in encoding._get_dummies_1d at line 286. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/reshape/encoding.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":"pandas/core/reshape/encoding.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf3dd52d7a45ca48245f148eb1798b31c6789d004e15b9738f22b9482eea762"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/arraylike.py: pandas/core/arraylike.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in arraylike.array_ufunc at line 278. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arraylike.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":"pandas/core/arraylike.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d68e775e1aecb9cdda71e069a381153da57637298ca0c44fbd01e97614abca5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/arrays/period.py: pandas/core/arrays/period.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PeriodArray._from_sequence at line 261. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/period.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":"pandas/core/arrays/period.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"86474ba21d4ddbfb0b56aa249e76f3941cd85e748e106c074ef17cab00839ea9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/reshape/concat.py: pandas/core/reshape/concat.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in concat.concat at line 163. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/reshape/concat.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":"pandas/core/reshape/concat.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0e8151719b0a4c0264e656e967857e110fb4888d9dece6df27af70a7197343"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/arrays/boolean.py: pandas/core/arrays/boolean.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in boolean.coerce_to_array at line 183. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/boolean.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":"pandas/core/arrays/boolean.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfee1ea6d5c1aa5cbb230cb0de77685efb3b378b1737e1daa71680e9547a8cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/arrays/string_.py: pandas/core/arrays/string_.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in StringArray._cmp_method at line 1230. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/string_.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":"pandas/core/arrays/string_.py"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894de8a8b190fdd42a793d04d124ed9f04ea130553fefc73e768b2657ae9afa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/parquet.py: pandas/io/parquet.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in parquet._get_path_or_handle at line 97. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/parquet.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":"pandas/io/parquet.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fae0a72f2f4e13c218447a966e5222891926c5dfbb845d27d644dda781ed987"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/formats/html.py: pandas/io/formats/html.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in HTMLFormatter._write_col_header at line 291. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/formats/html.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":"pandas/io/formats/html.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"de258604c96896bc28854685855a127ac1ccd8eb3eb3db845cf2ecf906082056"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/computation/pytables.py: pandas/core/computation/pytables.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BinOp.convert_value at line 255. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/computation/pytables.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":"pandas/core/computation/pytables.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7d6ad8d3cffa68dec8448e7db56dae84ed53aec24b0527e9ef6ca8dc7156e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/formats/printing.py: pandas/io/formats/printing.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in printing._pprint_seq at line 116. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/formats/printing.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":"pandas/io/formats/printing.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"222c7644f72b03c62652bc34d536a5bd5fbcf0e33db236f37f5332f116df68e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/json/_table_schema.py: pandas/io/json/_table_schema.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _table_schema.parse_table_schema at line 357. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/json/_table_schema.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":"pandas/io/json/_table_schema.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"910760f2d27b9cd876523cdc529e1ca2a454e19a57eac4ab6984eaf42d365d7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/reshape/reshape.py: pandas/core/reshape/reshape.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in reshape.stack_v3 at line 1002. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/reshape/reshape.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":"pandas/core/reshape/reshape.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d0555a0035f160ff3d32fe4254e6b85a2c86addb92e5e09240b44a631d3b62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/reshape/pivot.py: pandas/core/reshape/pivot.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pivot.pivot at line 748. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/reshape/pivot.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":"pandas/core/reshape/pivot.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d1696aebb7d768d51cfaa18f8ac6d8624ff171bb95534b21982d803096fdb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/io/json/_normalize.py: pandas/io/json/_normalize.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _normalize.json_normalize at line 320. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/json/_normalize.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":"pandas/io/json/_normalize.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a691ea29184fd8d1ff1be08f2cba65a8e2592ba1bb8367e0aa725ed5a9bc0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/dtypes/astype.py: pandas/core/dtypes/astype.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in astype._astype_nansafe at line 66. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/dtypes/astype.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":"pandas/core/dtypes/astype.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49f976d1640fe32db51d9c0b0ae4705642439dcafde3fe32ff8db0b621c451a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/issue_assignment/client.py: scripts/issue_assignment/client.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in GitHubClient.iter_open_pull_requests_review_state at line 186. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- scripts/issue_assignment/client.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/issue_assignment/client.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3181d4fba62875dc062b4a4f08c675673408f9a3bd33e29fd2f7794bb3af676"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pandas/core/methods/select.py: pandas/core/methods/select.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in select.select at line 60. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/methods/select.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":"pandas/core/methods/select.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c8360eb0c023d275b8ab087142011b72e9d741998708694a1d07c90865c0f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/computation/ops.py: pandas/core/computation/ops.py changed 11 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is BinOp.convert_values at line 464), 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: \u201CBUG: query/eval with unprefixed Timestamp/datetime calls (GH#50442) (#71830)\u201D; \u201CBUG: eval/query TypeError adding a string to a string column (GH#47734) (#71792)\u201D; \u201CBUG: eval/query with Timestamp or Timedelta scalar arithmetic (GH#52559) (#71234)\u201D; \u201CBUG: query with tz-aware column vs naive date string (GH#26236) (#71091)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/computation/ops.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":"pandas/core/computation/ops.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"65721f3a95b664a8a6c08b94fa08b7a42a1e47afe65980d0c2778999bb2b3ec4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/io/sas/sas7bdat.py: pandas/io/sas/sas7bdat.py changed 10 times in last 90 days and 8 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 SAS7BDATReader.read at line 1010), 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: \u201CBUG: read_sas IndexError for column text on SAS7BDAT amd pages (GH#60809) (#70809)\u201D; \u201CBUG: read_sas exhausted memory on a SAS7BDAT file claiming more rows than it holds (#70721)\u201D; \u201CBUG: read_sas returns rows deleted from a SAS7BDAT file (GH#15963) (#70734)\u201D; \u201CBUG: read_sas held a SAS7BDAT file open until a cyclic collection (#68973)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/io/sas/sas7bdat.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":"pandas/io/sas/sas7bdat.py"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1f785724c9c6aeb68566a25b60a9f1248d60072bb75e1c07cff2f2b7dc4d2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/plotting/_matplotlib/timeseries.py: pandas/plotting/_matplotlib/timeseries.py changed 9 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is timeseries.maybe_resample at line 123), 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: \u201CBUG: ts plot redraws series removed by ax.clear()/line.remove() (GH#54485) (#72052)\u201D; \u201CBUG: bar error caps/axhline misplace secondary_y line on time-series bar plot (#71436)\u201D; \u201CBUG: misaligned period-end timestamps on mixed-freq ts axes (GH#11574) (#71399)\u201D; \u201CBUG: datetimes on a sharex/twinx sibling of a time-series plot drawn off-screen (GH#40470) (#71685)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/plotting/_matplotlib/timeseries.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":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9364aedd661eec995c96aeef9e1d13241ea3e905290522d048d6fea6b73daa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/arrays/_arrow_string_mixins.py: pandas/core/arrays/_arrow_string_mixins.py changed 9 times in last 90 days and 7 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 ArrowStringArrayMixin._needs_python_regex at line 113), 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: \u201CBUG: \\s and \\S in str regex methods missing Python whitespace characters for pyarrow-backed strings (#71025)\u201D; \u201CBUG: fix string regex operations with $ end indicator (always match Python behaviour) (#71387)\u201D; \u201CBUG: fix string regex operations with Python unicode escape sequence (#71383)\u201D; \u201CBUG: str regex \\w, \\d, \\s and \\b only matching ASCII for pyarrow-backed strings (#70773)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/_arrow_string_mixins.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":"pandas/core/arrays/_arrow_string_mixins.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"434b68e736874f1d1444fc0b17e5d626f9434375f20a330d64b379b455542944"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/computation/expr.py: pandas/core/computation/expr.py changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is BaseExprVisitor.visit_Call at line 693), 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: \u201CBUG: DataFrame.eval assigning to a backtick-quoted name used the cleaned identifier as the column label (#70575)\u201D; \u201CBUG: unary op on object/string column in eval/query with numexpr (GH#45876) (#71831)\u201D; \u201CBUG: eval/query with numexpr on object or string columns (GH#27639) (#71228)\u201D; \u201CBUG: eval/query with Timestamp or Timedelta scalar arithmetic (GH#52559) (#71234)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/computation/expr.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":"pandas/core/computation/expr.py"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e7270388ed971a6be0e26f809d2fb3beef2416090ce505927d222f625d87c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/computation/expressions.py: pandas/core/computation/expressions.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is expressions._can_use_numexpr at line 97), 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: \u201CBUG: int with float32 arithmetic loses precision on large inputs with\u2026 (#71458)\u201D; \u201CBUG: don\u0027t use numexpr for integer pow (GH#54546) (#71096)\u201D; \u201CBUG: numexpr results use a nonstandard int64 type, breaking select_dtypes (GH#17945) (#69427)\u201D; \u201CBUG: defer the blocked-numexpr warning to first use (GH#66956) (#68465)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/computation/expressions.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":"pandas/core/computation/expressions.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c052b83627ab6ab85ca4d6d72db63f6b01731f07ec01761951a6efba5efee7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/common.py: pandas/core/common.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is common.asarray_tuplesafe at line 245), 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: \u201CBUG: drop with a bytes or __getitem__-only label (GH#11740) (#72039)\u201D; \u201CBUG: list of nested-tuple labels raises ValueError (GH#43780) (#71793)\u201D; \u201CBUG: spurious ChainedAssignmentError when setitem is called from cython (GH#51315) (#67029)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/common.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":"pandas/core/common.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b9ca890187f861d95d69b0d641722a4e0d18b5a0a9d332f76c15e8dae2f0cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/arrays/numpy_.py: pandas/core/arrays/numpy_.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is NumpyExtensionArray.__array_ufunc__ at line 257), 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: \u201CBUG: unary -, \u002B, abs on object dtype with None (GH#42862) (#72045)\u201D; \u201CBUG: the logical ufuncs were not rejected against datetimelike data (GH#68524) (#68524)\u201D; \u201CBUG: NumpyExtensionArray repr double-quoted numpy bytes values (#68080)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/numpy_.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":"pandas/core/arrays/numpy_.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f02999854d8f789f434320d220ea125f9fb924cb0112b27f23b7800b5bed402"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/util/hashing.py: pandas/core/util/hashing.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is hashing._hash_ndarray at line 365), 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: \u201CBUG: hash_pandas_object raised on mixed-type values with non-ASCII bytes (GH#27215) (#70493)\u201D; \u201CBUG: hash_pandas_object on DataFrame with no columns and index=False (GH#24318) (#69489)\u201D; \u201CBUG: hash_pandas_object gave different hashes for equal float and complex values (GH#28363) (#66955)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/util/hashing.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":"pandas/core/util/hashing.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94eeda3cda209c6c6e13f5231fb2f58108830a253aecff0e46ff663c60fe6b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/arrays/sparse/accessor.py: pandas/core/arrays/sparse/accessor.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is SparseFrameAccessor.to_coo at line 412), 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: \u201CBUG: DataFrame.sparse.from_spmatrix gave the unstored entries a missing value (GH#59212) (#69115)\u201D; \u201CBUG: DataFrame.sparse.density warned for a frame with no columns (#68564)\u201D; \u201CBUG: SparseArray.density raised ZeroDivisionError on an empty array (#68468)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/arrays/sparse/accessor.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":"pandas/core/arrays/sparse/accessor.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2145ba66fce65184eaefa51270fe20526243a98081790c780e74473478b2cb5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pandas/core/ops/invalid.py: pandas/core/ops/invalid.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is invalid._is_datetimelike_dtype at line 134), 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: \u201CBUG: the logical ufuncs were not rejected against datetimelike data (GH#68524) (#68524)\u201D; \u201CBUG: sparse comparisons densified a masked operand and lost its NA (#68579)\u201D; \u201CBUG: bool operands were not rejected against datetimelike data (GH#68452) (#68452)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 09:30:55 -08:00\u0027 --until=\u00272026-11-14 09:30:55 -08:00\u0027 --full-history --no-merges -- pandas/core/ops/invalid.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":"pandas/core/ops/invalid.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb1e0d75c8cbd4a692d40d2885166835f0d8fbdd1e8cd080f6cb48571687f71"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 18 significant file(s) lose their only recent owner: pandas/io/clipboard/__init__.py, pandas/core/array_algos/take.py, pandas/plotting/_matplotlib/hist.py, asv_bench/benchmarks/rolling.py, pandas/io/sas/sas_constants.py, asv_bench/benchmarks/algos/isin.py, pandas/core/computation/scope.py, asv_bench/benchmarks/inference.py (\u002B10 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ad5229d078d55265e81ebcd2f9ae550245cb383b62c3fdbe7c5f158b36b8c93a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: scripts/issue_assignment/client.py, scripts/issue_assignment/core.py, scripts/issue_assignment/messages.py, scripts/issue_assignment/label_awaiting_review.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2c81783aaa3625730f8e407b9cfb638629384662ad448dd33e2197a01e9dd710"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 4 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (26 single-owned of 286 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; 286 of the 386 production source files in this repository met that bar). They are anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: asv_bench/benchmarks/reshape.py, asv_bench/benchmarks/index_object.py, asv_bench/benchmarks/stat_ops.py, pandas/core/arrays/arrow/extension_types.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(4.0): GH#55043 - remove upon removal of CoW option"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate_unwanted_patterns.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"237549a4a5de0391d59d745df50a0259c56403cc36e357fdd57a794ce31b4247"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW) see https://github.com/pandas-dev/pandas/pull/51082"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/test_downstream.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf00c4e07c238bce51bd7e99f528ffe8a96fcbd231361068d5645f517d92718"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could check with arraylike of Period objects \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/test_downstream.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c98877d2e2a2114ae4c68aa0f20b5e7a9eaa37356f4936b20ce63ba15268079"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: to get the same deprecation in assert_numpy_array_equal we need \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/util/test_assert_almost_equal.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3ae118139a911774c0c8698262cc30d663f092a1b9cf6691aaad4577efef9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: to get the same deprecation in assert_index_equal we need to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/util/test_assert_almost_equal.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14d235320e66099aea6b514888841281427f87c8a89098dfb05cea043246e02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: tests that include tzs, ints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/tslibs/test_array_to_datetime.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f8b0d00510081ba48b6518d4a5e7976efda207770293a2fe951a71ad5eb284"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#55564): as_unit will be unnecessary"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/tseries/offsets/test_business_hour.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddf785a7ad5a2f6fa6b67d09abfd0ca15fbc40e4a61e65fefb4b0e486bf95d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#55564): as_unit will be unnecessary"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/tseries/offsets/test_offsets.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f20c092017d833605f590ac7486a75ffbfb77507136e9f7530d08c91567adc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#55564): as_unit will be unnecessary"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"47da41a9338523b9141326c645f0b3b65882fd0112724759beef37a2f6ae64b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#55564): as_unit will be unnecessary"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1059ef8c91350370270f5452abf9192a606c8f143a4ed46eaac96a7ab12516e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: belongs in arithmetic tests? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/tseries/offsets/test_offsets.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c547943f2af808aa0beb7d687d67a90fd1917a6b5c2ce2f77f8dfa4d79882a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Timestamp raises ValueError(\u0022could not convert string to Timestamp\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":"pandas/tests/tools/test_to_datetime.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b2ad1b86effcd560d30c3541be7212ba9c4a58857769d0e6e0543d1045b432"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should Index get \u0022s\u0022 by default 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":"pandas/tests/tools/test_to_datetime.py"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f3472c10f17249b2f650cde376bc13723e4306f7aceb2cf7da68c64a1fc596"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO typed array code path fails this case - internal error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/tools/test_to_datetime.py"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92d39cb9a2bbd72fbd2826e5fbe775ecb197193ade849facacd6f16ea6d1f78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Strimg option, this should return string dtype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/strings/test_cat.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d32ab3d0e85e6df45b0d61d00f5e3c865f8eb6c370bb315503cb7c06f3eae1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should this raise TypeError \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/strings/test_extract.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dfce8671edded29bbcf24a5b5c295571628e569ed5ea55a9c89c202aff1448"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO this currently works for pyarrow-backed dtypes but raises for python \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/strings/test_find_replace.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"54531a7834cb87eba6b033916530c9b0aad347a48ad05b7ec65330e9b09b5d15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO this currently works for pyarrow-backed dtypes but raises for python \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/strings/test_find_replace.py"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc98cb0521899055507e8114ecb4829d1648256c0241a972baaac94548e57514"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO should this be supported? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/strings/test_find_replace.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efc005b84e03638d676845ee91c0f91c030d81998f69855190655404ec38757"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (https://github.com/pandas-dev/pandas/issues/63683)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/strings/test_find_replace.py"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad3866d65c43d2aa6f6c540269887ef5b61295da364eb677c523eb92e99bc64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO see GH 18463 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/strings/test_split_partition.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e86f793bb4b1c62f30ff40b43242040cf16515d20dc62b90b91c904afeb31f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: belongs in tests/arithmetic? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/test_arithmetic.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"b784fe90068c75a2c5955eadad0896c61fc855591103c53761e53e4da3b25c56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: try to align 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":"pandas/tests/series/test_constructors.py"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7c1d1b9718dbcf7f293b8e3751fcadd79e09b49b859dd315446b67662e9b4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make this not cast to object in pandas 3.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":"pandas/tests/series/test_constructors.py"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cc90d7a92e814cb7f356f12c162b2f7d325aa43ff9aca141b66293eec99bef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make this not cast to object in pandas 3.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":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":3538}}}],"partialFingerprints":{"codehealthFindingId/v1":"c564f24c87544ae0b71d80985fa9d14859d1f448a24b5621d8a9817dc71349f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(infer_string) should this behave differently? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/test_logical_ops.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e787c507069a34c5233c87ccb348d05b8fb456e6f2379f3c38aa66dde08e899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: np.modf, np.frexp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/test_ufunc.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7dbf2fdb5232a26cfd4030a9f21a1d82d684d43a28d8bbcc7c535a235574f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: cases with NAs, axis kwarg for DataFrame \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/test_ufunc.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3b0ceaebb77d681ce31d9c773f18b9469518987aa04bfad8f230a4e5c8dcfb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: cases with axis kwarg \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/test_ufunc.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"620cf6ad17f965c35e6ae9886d73635241741e6f9ee40123576e660a20a16969"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: assert something? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/methods/test_align.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ae1e2438fb05fe44dba3b3c88c466453147851a7c8403231ee5863dc3339b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: assert something? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_interpolate.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c32be1137a2110a523d2da541b0c4e03b2a1457cdf45b30438b89bbb8275de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: same for EA float/uint dtypes, signed integers? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/methods/test_astype.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c704569df27b9b080e59a29190078d20d534a5a0bde52357742ddf4674fa51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should _cast_pointwise_result attempt to preserve unit? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/methods/test_combine_first.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b0d565fc9189ca700946217490f9ceaa3796c2bc29b6a7fdd992142f864838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(__array_function__): could make np.diff return a Series \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/methods/test_diff.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b36f4d3d0e1f2872eed2f9e262a3dd4a6bf47214b29c65effe37cf150fecda9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: these can work but need to update ser construction. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/methods/test_rank.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fca3593e6c4629c839539227ca4ede6351a5f20263ba6a520d33b5f5003d5d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use ser.replace(np.nan, NA) once that works \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/methods/test_rank.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad926cc1ff4d5ad89bf49d2c3a447eb15e10034038e770289b9e1d984054a6aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: ser.where(~mask, alt) unnecessarily upcasts to int64 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/indexing/test_setitem.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"760ca73d510bc91721baadbe26aa4b5d02a52e84a6ca42f9b95090fbdcc23276"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe go to float64 since we are changing the _whole_ Series? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/indexing/test_setitem.py"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea725109b6e5a03cc41bee3f3fcefe251832c42a1c583eecf4adbfbb9613996c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could also try np.full((1,), td) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/series/indexing/test_setitem.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fda043e093e014e4d43662c7546a284c4007589f541fced148f8d912591acd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parametrize over units just above/below the implementation bounds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/scalar/timedelta/test_constructors.py"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e347fadcc6174b49201a9ce2cd1fc9008a26f5e14f7234dfe21b33b5a11949a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is a test of to_timedelta string parsing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/scalar/timedelta/test_timedelta.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"26732f2bf22d68b54a734e1e6dc59e77d1f359f4ae6e26b1cfc5d3ee43bb058e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is a test of to_timedelta returning NaT \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/scalar/timedelta/test_timedelta.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5679adbe798548039be3476a8088710babd9fd3030cffb88069144b045107f24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: constructing DatetimeIndex with dtype=\u0022M8[s]\u0022 without truncating \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/reshape/test_cut.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"b505e0107249128090d1e9722ffc16080e0d34703f7520a527dec7d4b1b8e076"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # hack (NaN handling in assert_index_equal) \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":"pandas/tests/reshape/test_get_dummies.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7059a39c98d23e3e32f567f676e8dd7b5498623dba8c510893240e7a332c25a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should the next loop be un-indented? doing so breaks this test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/reshape/merge/test_merge.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c024e40c82a3817905a1cbb4dd4bb6a10f3570fc52cafa86f6880bfb5766493"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO check_names on merge? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/reshape/merge/test_merge.py"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a25159e0897ea81af9ffb5fde74706c07795a64334b06f0d37376f0005bf248"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: might reconsider current raise behaviour, see issue 24782 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/reshape/merge/test_merge.py"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d376d45ec345cc35fd313c3dca4e4d7ed3db3d868b41e9118778240f5067ea9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#32306): may be relevant to the expected behavior here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/reshape/merge/test_merge_asof.py"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c4c77225de55907d097aeaf46f96809b5da3da96c5e191ec4964ab8c410d0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO what exact behaviour do we want for integer eventually? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/reshape/concat/test_concat.py"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1acd5d3263ad053735eb786dafd0b0619c9c21fe666e9448846a2e5f355452"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO what exact behaviour do we want for integer eventually? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/reshape/concat/test_concat.py"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021fcbe4123b40a18cd9f67ef2d223d40ed07b6767b64c6c12a54ce21f84672"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: no tests with len(df.columns) \u003E 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":"pandas/tests/resample/test_base.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5892b4757d2e310e8c2775057ffbf915bcfa4e72a834562e4b84ac496a2d86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should this raise at the resample call instead of at the mean call? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/resample/test_period_index.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c670260ea60bcae31fac2c6401e9ee2cb6b73b0cdfe0b88c5df0ed3bc233204"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is non-tick the relevant characteristic? (GH 33815) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/resample/test_period_index.py"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"52223ceb2e2869977e58140e1d5c252f14ff1d49cb2cf9693027aa21289a7582"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#14008): once GH 14008 is fixed, move these tests into"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/resample/test_resample_api.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc7a4cfe4bb32032d830431feff38e9cfeb9a0af1519fea75bd15dfafd94ea4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is this desired? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/resample/test_time_grouper.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"739986ed1b0cdbf3266ffe11bf35081ffdab0c05909bfaefa4ad06373c4aefa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: color cycle problems \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/test_datetimelike.py"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d072e17ffec973fe42fb000bf0b3d025d1f3b37342dc3fc465e847fe5b574a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: color cycle problems \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/test_datetimelike.py"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0099ea13393eb50065e388f38bfbe4f3bc5f513ff9a7ea9482f7848902fddc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: color cycle problems \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/test_datetimelike.py"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"70714425a7dd28ccc908208546e9bc894f54451003d2f9662f480151a9c465f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: color cycle problems \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/test_datetimelike.py"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"42646a430798cceffd10ad58ec57589a465c580857786b8bafa640a28e1fd9e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do something more intelligent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/test_datetimelike.py"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3758d850e7e2b2be21dcb66995238f9a9e51fbf534a90f04e1da4c683569444"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(4.0): this can be removed once Period[B] deprecation is enforced \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/test_series.py"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"646c5a3af41db9944533f68b6df1fb982279dc5c0d1cd924c860921e4c6e18e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(4.0): this can be removed once Period[B] deprecation is enforced \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/frame/test_frame.py"},"region":{"startLine":2866}}}],"partialFingerprints":{"codehealthFindingId/v1":"228b8d95b34bdc900326e12e756fd78e31116f8c239f0a1c3d2ea5eb1652309a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add MultiIndex test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/frame/test_frame.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be1ad980d7d78e06b2e118addf9e278599f763dd1e0542debae44e3fbce44f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: need better way to test. This just does existence. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/plotting/frame/test_frame.py"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"3477c8c8efb7123c7ae754f96995f9059deab8dcbd193638f4740a4efa15119d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: moved from test_algos; may be redundancies with other tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/libs/test_hashtable.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e3a1d470352d4de621e12b15828ce0d34ff36a30362a081af683272a00f33c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: without casting to ns we do not round-trip correctly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/test_orc.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c572517220b05849f92b18fc26f92f28d3434dd44ba5cf02bf3d509ad552649"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK! \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":"pandas/tests/io/test_sql.py"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"de61ac4709e0f1c7505ab024a070089081951da4cb064815d61f6c381c3ec805"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: clean up types_data_frame fixture \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/test_sql.py"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e554f1a0c87e8e0b572a28f1c2a17981a74f9551651d2771b8afe29fa27821e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Postgres stores an INTERVAL, which ADBC reads as a Month-Day-Nano \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/test_sql.py"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"08350df5725688864eff151241939051e93dc15ee31821484ce7b59257445acc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK! Change this once indexes are handled properly. \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":"pandas/tests/io/test_sql.py"},"region":{"startLine":4633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ad7f936d23bba4c231da9d0090e9669192072f1c03dce959034f84cf034e88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#55564): just pass M8[s] to the constructor"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/test_stata.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"91573f2512e918514472fbdc2d46eef6f1f0a9daa2127f71045f2bbb211a3e60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#55564): directly cast to M8[s]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/test_stata.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc44d877cb73aed5f80ae9a9b3a4006c54774e3396575acddfac408cc5c270a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#50598): the correct answer is df.iloc[:5]; PyTables returns"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/pytables/test_select.py"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce247169c9201ef305daff8e6b39193d4d62477f438c49e74dcc5534e779ddb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#50598): five rows should have gone; see the note in"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/pytables/test_select.py"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb2ed121f91822e00696c07ecd7a7a4e3651af0e145923c21d48d7b021469cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this test isn\u0027t about the na_values keyword, it is about the empty entries \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/parser/test_na_values.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"08249d835632b9b3b2821ad91c3857a5f46f93f78516bcec41ec6e529b57d15b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # (TODO: parse dates directly in pyarrow, see GH#48017)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/parser/test_parse_dates.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b33937a1e4fc6fee7a1e11da1616da6ab5c787ba94d7815a2caf0fab58a676"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: write a regex that works with all new possitibilities 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":"pandas/tests/io/parser/test_quoting.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e45b58d974bccf298de67a75da2c367813f8b4f0ba62d76fe3a1de8822759de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: datedate.date? datetime.time? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/json/test_json_table_schema.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b0c926fe395a1cb0e6770e59667564d9b3204b81019845cc36ac128210357c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#14904) flesh out dtypes?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/json/test_json_table_schema.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"014e7eb3b628e33e8000531a49afd9a003efaa6d041811d6c89b0176b80b8a55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: a to_epoch method would also solve; see GH 14772 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/json/test_pandas.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb691f68c408e2246e0dca7bbb295ca7e867df414ebba8561d69cf716bd9259"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: create a better frame to test with and improve coverage \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/json/test_pandas.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e63e4cd69a257792533a47db66cfb27a187f947ac2f62e8336bd924bff4a386"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle consistently across orients \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/json/test_pandas.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2560187ac11aee0250ee49bcdfcd2d51f3f82f9e7e1d7b8877a556e7028a399f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: there is a near-identical test for pytables; can we share? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/json/test_pandas.py"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"40442a7d2b192151572f6e257569b5e88ec8054dd9d80aaa6a5cc95acd0755b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: the below have separate encoding procedures \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/json/test_pandas.py"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cbae9e608db7bd9ec0c81f1bc75149ca1f036c8bea38c1abd91cb9ecea9d2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: split this test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/formats/test_to_html.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd51372892faca25aeb2f55ab8dd7ee90ee9360773ce10db9a2a718771ebe972"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: assert that these match?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/formats/test_to_string.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f070a67d0f9a6663f7b07a8ff2f27f53b77a8cdf0146d46b26db61179f1ba87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: split or simplify this test? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/formats/test_to_string.py"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1007cd1e7a51f9ce310423700b4cce89be56c2d02c344e78a6924058b5e49c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add index to xls file) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/excel/test_readers.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aa4438a1eddbe5d8e9136b4909c5df36d3c10049cb2a864ae1f1640f48b1e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add index to xls, read xls ignores index name ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/excel/test_readers.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7416d8093c3f5fa6919fdc66cc9f82ac1cee48784389d4f3944779bfe3955f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add index to xls file \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/excel/test_readers.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fb9d8f02a4d899b3aae30a2e8c301bf613a1a9629a12ea67edb1888f5d3c76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add index to file \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/excel/test_readers.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d205273a08ae7e90ea8e648fcbb06912240d4b2deca10ffff542130fbfae967"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should find a better way to check equality \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/excel/test_style.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f8680e3e4daea44f42828b964e1c74a4d11f26d8c58190c7c269e5255d217d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why do we get different units? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/io/excel/test_writers.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dfbbfb30c714b83b101309f730efc1b5c446d880c3e4f63f9ad1d35a2d511c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check this holds for all blocks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/internals/test_internals.py"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6374dfbfeda8f94ab60b6dc6e6da22ee6274ca52f603e447c3483bf2dd1c7a1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use ArrowSchema to get reference C-string. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/interchange/test_utils.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0233bcd45e3077e3956c3d76431bb75d9e6fa2eac860ea018db44c736ce66ee6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: De-duplicate/parametrize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_at.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fa2c314ffb1ab888f1d58ae7d27e587ab456042a1b7641bf04c8e0fc90e14f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use tm.raises_chained_assignment_error() when PDEP-6 is enforced"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_chaining_and_caching.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"692b5f3e45f1c0cdfd8154bd92e0c5832edd85c05e25e3c615243b0b670b4853"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # Hack, in the 2nd test case, since 1.1 can be losslessly cast to float32 \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":"pandas/tests/indexing/test_coercion.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f28892297757b596eccb1a439706b6573c315b2489c0ac4bd7f39161ac6775"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: ATM inserting \u00272012-01-01 00:00:00\u0027 when we have obj.freq==\u0022M\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":"pandas/tests/indexing/test_coercion.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b4ddab3beeeada019c9cf1fb53e9c181bdcf1b790edc6432c4d7ae8d26f61a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: GH#27620 this test used to compare iloc against ix; check if this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_iloc.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db0aa64396139a819de0cf4ba8b96ce589feb3d740ead99b4120679449ad9bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make an extension interface test for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_iloc.py"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"a479c9d38a3d4e2e9071e2d9df9188d2a498ae7e946718292bfe1189fdc9c4ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): we can make this no-copy in tz-naive case too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_indexing.py"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"535b22790054bc880ab1f1f6220624082d63734210e0154a451b96e3dcfd0d1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): we can make this no-copy in tz-naive case too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_indexing.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"55749521f906308fab28aea7200ec339469d40d603ec3015804cc648c2c83f38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO this only happens in case of ndarray, should we make this consistent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_indexing.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7df5f9cc76d7be99cba68fd72fe51d1c625e3ca4eaa07f3de896f7cbca27f7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test something 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":"pandas/tests/indexing/test_loc.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fcda444aa17b7443c03726ed9e6a82526116f5ea84259c38ecb0aa31f9da5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should it?  unambiguous when lengths dont match? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_loc.py"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39714550eaabb99537054af4cdba0ac0f55babb360a6e50c6cefdde69a221fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should we have name=\u0022bar\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":"pandas/tests/indexing/test_loc.py"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5833841ebe726c0f59f7daab23921d73167cd06ae52bc78afe771d8bda19a6ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: using a tuple key breaks here in many cases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/test_loc.py"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef8a02b1d40563bb5be614e062a4664d70f716da4e758a4dbd5abd1ef38e349"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: standardize return type for MultiIndex.get_loc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/multiindex/test_loc.py"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"d261c87ff2566d0f08315d7f4beacb355df183051699561068654c61a67b1cf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO KeyError is the appropriate error? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexing/interval/test_interval_new.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3826154ab7e1342387a27c2d7cabefe85711859d86e83514a24e08fbbcfc177a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could work that into the \u0027exact=\u0022equiv\u0022\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":"pandas/tests/indexes/test_any_index.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef348a7e3c87739ff28f6fb3ca61f6aa4e2a9a9d432176f514111ebc7d4a7d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: doesn\u0027t belong in this file anymore! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_any_index.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d9a7e3f67322d76ddbf1d701d507a8d669eecb4a04f14f0ea049348f0ba913"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: a bunch of scattered tests check this deprecation is enforced. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_base.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"73babcac1d36040db55e2ca002f484541f2ebdb89135cca8dbac35e5175f1499"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should right.asof(left[0]) also raise? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_base.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"333aec9d4808f90c302087f99c2f4cb5361a1231d871b433efb31db76eb19b67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Replace with fixturesult \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_base.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cecd4d96c09c1304e98f8c84e0ef0e980ff538c42fad2c28b6dea1ef4bbb39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Parametrize numeric and str tests after self.strIndex fixture \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_base.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f467bc5e2c306192d150504be2a8ae05dd917196fd0140ccaf810cd2434327"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: belongs in series arithmetic tests? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_common.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ff3e287aa6f99ec4d7bb1f5522f02f7bc7b8b26a6f81de674ac9827fa9889a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we want this to raise? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_indexing.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a91eaa05b39cc05218f906bba2449bea0ac3d3c1aaae7aaca07c6e338485878"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make these more consistent? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_indexing.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b74d503e7ed2910daf1e914774f627889881bd62b6ce2ebba2336380c6da5d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make these more consistent? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_indexing.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07bea060ab5e2b237dc060efc13f5596780711499c1e0624348ebd86c14104f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: overlap with tests.series.test_ufunc.test_reductions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_numpy_compat.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d196d8a2af010b0f0f781322eaa6861f2c28ec95f4b7ddf296e137ea1da5319"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we have cases both with and without NAs? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_numpy_compat.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d31c654fa739bd4278666458f498a26f41f41575f96ff216deae4e39d73f310"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: pin down desired dtype; do we want it to be commutative? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_setops.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcbbe86a50c77b7a19ffe10aa5ceddabe4b127bb14bad7f2525fc7068bd7490"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # i think (TODO: be sure) there assumptions baked in about \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/test_setops.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7160d186921fcd96832942dcecf225b7f657cce006645ca3b35d94f755073f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is a Series.__repr__ test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/timedeltas/test_formats.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dde665505eec0979301dd20f5aaf796fed390f8ad5cdc740d499171e5456c29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is a Series.__repr__ test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/test_formats.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2ab6c620805e2aeca2522cc05d2febc150650d77415ab607bbde1a711f403b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: de-duplicate with test_tdi_round \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/timedeltas/test_scalar_compat.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee252b9922e5c61f5234746c605f5fbf3d27cd6864fee1e99617a4fafecd2aa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: These are Series.__repr__ tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/period/test_formats.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b40f84ccdae3b919751c47b7ad623124d4610994f1da6e418fb22d5ca557454"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This method came from test_period; de-dup with version above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/period/test_indexing.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be2420286418b9a1741862cdb5f0185988abd4cac5dfa052ebc8bfd6e617296"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this test used to test get_value, which is removed in 2.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":"pandas/tests/indexes/period/test_indexing.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bc49779845375ef9d494dff0261a1096fac77327b4275420dde4c0302f60fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Todo: fix these accessors! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/period/test_partial_slicing.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c59583cb94832a3f0dc5de151df476dbbacee918abb91d8b869c0bce59ee8ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: de-duplicate this version (from test_ops) with the one above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/period/methods/test_astype.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6461dd5f56d23f49880c28d33273fb4883a88a465a8f47e2b9e456787f15c28a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we could plausibly try to infer down to int16 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":"pandas/tests/indexes/numeric/test_numeric.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8c3002f61b1e46fb9bca6e69d92de362e2c3636ab03769f5c79c6ab969057e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: reshape \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/multi/test_analytics.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee25cc39e4d092358603206a46ba7281e94b031441c8ddc29083b3c540f302fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Try creating a UnicodeDecodeError in exception message \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/multi/test_indexing.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb82de6b8ccbf47386a5374e133f38868e94274bd238222da112df45859b1d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: de-duplicate with test_get_loc_duplicates above? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/multi/test_indexing.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4fd29fb70fdf9408d7c675997f4c555997cf7307c5ad5580ab0f3e5a92e6eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is raising in constructing a Categorical when calling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/multi/test_setops.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82d674d681cc43c4dbb796c9bd5d5b458371f9ae4bb1f37f406fc9b60bcb5df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is a test for DataFrame/Series, not IntervalIndex \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/interval/test_formats.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f547484334cc28b4720eada66022f4d0f07a8680536ebd7667fc47cebaa874"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: with mismatched resolution get_indexer currently raises; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/interval/test_indexing.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ade628b793c3ff9e0090b3ac259eea89cdd4ed0f997196235bb020289fa099"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO we may also want to test get_indexer for the case when \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/interval/test_indexing.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d309cab5237808d49d26bfa4df3206450e5b4059bf45be2a6b6f4429b3a9d7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: standardize return type of non-union setops type(self vs other) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/interval/test_setops.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f49b865bd3df1c4ea8bc9d7e8af2cf8a2082c37d00d4ababe89dbdf592da09b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: better place for tests shared by DTI/TDI? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/test_constructors.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8489e20e24573744dbb3d51a255e2018e294c76172930d1cfd204411999d0ad4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: The Timestamp constructor here behaves differently than all \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/test_constructors.py"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db53c85d719265b9264f80d9d55a55ac9edffaaa15692e411606a3c13f39828"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #    # TODO give a more useful or informative message? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/test_date_range.py"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c3c30bc8c896dda61986bda987541f3e679c4e16d8061638be8ecae4ad5ec7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This method came from test_datetime; de-dup with version above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/test_indexing.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"382bad30829d752a96a7fde46b2828d5dc3aebc060e07489c480f273d70b2009"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: moved from test_datetimelike; dedup with version below \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/test_setops.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c110b484b05aea31f1740a00d50513799b0507dfbcf1d21ac6c05e7a0d17ecd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: moved from test_datetimelike; de-duplicate with version below \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/test_setops.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c96810b2d120a68c46f9607b7531487288d1a5d096071d64b18fdf8a2e5030"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: also changes DataFrame.__setitem__ with expansion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/methods/test_insert.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4055c8b1f6c102ba0847eb9ab122aa1660284d43a4e00feaea6ef7514cfd91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: also changes DataFrame.__setitem__ with expansion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimes/methods/test_insert.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f4c1da624e302605795d96edf6da4d63458382282edef8bfda1eada23aa254"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: de-duplicate with other test_equals2 methods \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/indexes/datetimelike_/test_equals.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"096d93cb862da31c0ad007d81cc62e72b9c82c9b2e13a4eb0cd974b527ef49be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#34306): Use assert_frame_equal when column name is not np.nan"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_apply.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e3c3919fe21428b6f36b52cd5058d75857eba50aed6871692b5e3dd357a239"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implemented SeriesGroupBy.corrwith. See GH 32293 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_categorical.py"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf2c58c4c4361dd80dda0600e99a41d41e0f0b334e25f30149e0c08f0f05e80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO groupby get drops names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_groupby.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1392e84ebee9b00215cba03680b32355aa41924ab61914dd9cef454162a812ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test the numeric_only=True case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_groupby.py"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ac1c168a541d7eef192fd6a7335c57c8ab07cff8f710c9abb70bb9cb598940"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO check groupby with \u003E 1 col ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_groupby.py"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d94d0512d15e40cb36e7b4787b4b02744335a009e15c51879400dc9cbd64d57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Should this be 3? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_groupby_dropna.py"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cb39c14abe63b8d14192621246960016e27bd9175845d8ac77a88edcee8032"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should prob allow a str of Interval work as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_grouping.py"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"8057d3e848af393e08ad8f55e50983981b3dbfa55f9b786f92d0a333e44d8724"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: min, max *should* handle \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_numeric_only.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a78d83d3e38f501425a6af982d353b2b5793766b475e79480649990b0b4e3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test that has mixed na_value and NaN either working for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_reductions.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7714557838297a71e4433a586450e8cb08b0a88d05de67fd09274740c7cf618"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: For skipna=False, bool(pd.NA) raises; should groupby? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_reductions.py"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0677590a4d19864f4218384525c37b1f543dc41284f650eb6c50556ec67a78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Should be more consistent - return Int64 when dtype.na_value is pd.NA? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_reductions.py"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f8356db30013c0e7f4a3bb22bdf381974f913602a4d58c86dfb977c008cc1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we drop min_count=1 \u002B dropna() below? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/test_timegrouper.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0332d78bf7d2f793a8304ea0804d03df3d8c0d5a55c412bc1ddbcbe6655fc05d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we retain second reso in .apply 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":"pandas/tests/groupby/test_timegrouper.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9eb9bbdd0b8b97675bda009414b59357ecb610626f740a4466bfbb138cd6638"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Test more than just reductions (e.g. actually test transformations once we have \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/transform/test_numba.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f6707d80a166cf9db948060c9c122a25578e31e797a5f3421937eb8ca1e55f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: create xfail condition given other params \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/transform/test_transform.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"9642880b3b1efc981a9b223e42709ded04b6669dc316307e6a4216cc8fa421af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement SeriesGroupBy.corrwith \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/transform/test_transform.py"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"63327e0728cb6f84a70b90d1cb6dcaa19f7591095eff23fd83f10b59dc5652f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(non-nano): this should be unnecessary once array_to_datetime \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/methods/test_quantile.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fd60377ad1557a013c46e8c61886480bd22bd9cedf9402d764d1bc8fadd807"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nullable) also string[python] should return nullable dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/methods/test_value_counts.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"e288a129aeebb6d9abc8461c7b28aeb3a2d37fb794abfabc4f2efe75932ff1f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: agg should raise for functions that don\u0027t aggregate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/groupby/aggregate/test_aggregate.py"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2feb2afbd822a160fbe85e4b40b5792a089b86c8e087bb3dc73ad22f72e5378"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: frame \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/generic/test_duplicate_labels.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec807a07143e778d5cb245a305b4f5abb3a3d103dfc20d52b49125a048b65fa9"}},{"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":"pandas/tests/generic/test_duplicate_labels.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ded2c860e5da2480bf60facabc633bcb25264579796195d86caefafcac30162"}},{"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":"pandas/tests/generic/test_finalize.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e031dbcd8c25972fe4ed6000e3241e14ab5e297c8a5cc7c91616388f35051e3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: mul, div, etc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/generic/test_finalize.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab49f3165b76ff1a9874a7f362b35f32ba1e02f95a4ec3fa53661e4818c8e5f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: div, mul, etc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/generic/test_finalize.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2017a89ceaca215b57cdd8f92e896e32f96dd0dd03c053981ae7c228d560702c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test_bool_flex_frame needs a better name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_arithmetic.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5626d3d06b0703d271284afa61e199bd44a79ad4ddcedd8e49419b2afd6ad1c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: not sure what\u0027s correct 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":"pandas/tests/frame/test_arithmetic.py"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"034b2a7142766151008e20f1918285955b9ec75840061cb373dd616ba6eff696"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(wesm): Unclear how exactly this is related to internal matters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_block_internals.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e47ebdde985ae7db1cd7776ae9107b58d957f717e0c1176979e01d476a5a8e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this condition is not clear about why we have different behavior \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0588d07abd8c31382acfca80ece05bb05dc418deaaf5b330537f73ebd71776"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(2.0): ideally we should get the same \u0027expected\u0027 without passing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daad2375660a5db4b877485898fdb40bf558736ad66247fd9d33962a0dc815d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO can be replaced with \u0060df.loc[:, \u0022A\u0022] = 5\u0060 after deprecation about \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3f3d7982302faf472814ec5fe98d695a2f71bdc5d95a997b82c5f77a90d42a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: most of the rest of this test belongs in indexing tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":2933}}}],"partialFingerprints":{"codehealthFindingId/v1":"0350270e00b9fd7a53c3e188f91d70b30d1f66f2429103a9d47c9afb828d19ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME(GH#35417): until GH#35417, iloc.setitem into EA values does not preserve"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":2946}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d3d0dd8ec17fd5a4f0a35977d1eb85054f9e97e3d04c2b03a53e27346349fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME(GH#35417): enable after GH#35417"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecb32ed0c0590a6c475d3bc8025695445285caa97ec8a62f5d404d53b2beb7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: not clear if these raising is desired (no extant tests), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":3220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8a0262c8f2f436aa40e71b6d668b59eb43c10b292646a29892b8854ad4cfda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make a helper in tm? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbe4c51433543c81ce484fe7a805747d30f5e473220dd73b615686b513423dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: better location for this test? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_constructors.py"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"72373d9fac585efb3b1d968f38c59f180e491cf6276ee9d1a07d4e74a4a9a98d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(wesm): do something with this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_cumulative.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1cdfba04c6b3484d1f1152b2562d70ef04cad85a87896b52976004b6ba3be2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # fix issue TODO: GH ref? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_cumulative.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6f7bbb0faeaf36f2c737189f01633e9f8be2feeef90f034109081fbb22024e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: belongs elsewhere \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_logical_ops.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ad732b52508681bf8d3fafddf3323e78a6ebdf8a1eff216bae8ea50b4cb00d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: np.median(df, axis=0) gives np.array([2.0, 2.0]) instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_reductions.py"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a1837ffa5984cf5e6d6c51936a7799f2562fa3b1c96dfe58cdb5e73b50468a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why does min_count=1 impact the resulting Windows dtype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_reductions.py"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd393ba832006516596189d711afcb763515c04212bd6e2295ff7020e11cb48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(FloatArray): this will be Float64Dtype. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_ufunc.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f756994aca27c038ae568241e7d5982f978a25d6b968de8de829cb161298966a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: assert that we have copies? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/test_unary.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dd3b560828b97e630e064bd39a85d29d2e5a06ca10f9a09461aafe80f10560"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: actually check that this worked. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_asfreq.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb25901955c4d62582f2ba00bd3d3a6148dbe19756d794e02ecc075445bd0a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(wesm): verification? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_astype.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7073d23fe6ef30eab4450a9504402e7dec4b0b6a697aeb9a078d60cab88be4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this must be int64 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_combine_first.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48aeb58ac9d5c58b2f391c288283dd1e7aa4ac8775a4ebfe2e913b1a1dc459"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this must be int64 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_combine_first.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"179c6be173dffea6d248e7a70670d1fcadbc7e2a2a2760a37aadc2ddb62cdfb0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this must be datetime64 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_combine_first.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"622ece16b05563c9a9d5d5da852c7778c9bd59fc65b90fd297a2ea92b842555c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # GH#18463 TODO: is this really the desired behavior?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_compare.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e52adc05ea6662c8b3c19fe5d87a83c098b80a0f7aeebaf16c3324f94156baa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # GH#18463 TODO: would we prefer NaTs here?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_quantile.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bd22949303fe32b18181773021fbf6f5731a41fe43413d585429c83a4e1995"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: tests for axis=1? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_quantile.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d57f8b2ce996c61af4ad6cff28ad7a94143940643a9400fb0705c8d6293485"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: empty case? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_quantile.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95913c5a1bace35e313eab5355caa4c7fdd9c55eeeb88dfc2e3e2de69de793f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO nullable string[python] should also return nullable Int64 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_rank.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8720a73ed22937191889fe78eb023a84fdf6daa0756a6173ba0ce12eaa66e46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we construct this without merge? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_rename.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeef2af94e83a3675a5a1c077b17d421501734633e089c4306b4ea68a1b3b20"}},{"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":"pandas/tests/frame/methods/test_replace.py"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"53786ed4bed5852503ad6574d59fb4ab53e384367400d3f7925f390378bbd6a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: better name, de-duplicate with test_sort_index_level above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_sort_index.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bcd27b5510c5b87194580e51690928ea5f81332ebb9d4218bf6157cde332d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO to_csv drops column name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_to_csv.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e2159affe290d23544cb951edfb58308a1a7e76e125000a6452abbabe63400"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO to_csv drops column name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_to_csv.py"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5984f1a703b73760926e4c559142f99e74bc645fc8aaae3ec9a243f9e183efc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: untested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/methods/test_tz_convert.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa71dd183f802d905a69b0d99548b29f03e889f44cb92165ac0235b5494e2814"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: i think this isn\u0027t about MultiIndex and could be done with iloc? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/indexing/test_coercion.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7652788f20518e4674d4ad1c858b3bc5692a5d3603ae5e5dfc45f22155e79f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: OP in GH#12499 used np.datetim64(\u0022NaT\u0022) instead of pd.NaT,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/indexing/test_coercion.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1818d7cfd0b9d046bfb476a7d2af6b3c2719ee6ddf079835d7ec90fa4b3aad33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: rename?  remove? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/indexing/test_indexing.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a7c1d329a6cbffef250d0b7d450705a7eb382bf1e72647705b99daaa34ac14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: more descriptive name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/frame/indexing/test_xs.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75ff3f530230515f8aa9613e42d2a1141baf1068b5796166e429f7e44d4995f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: skip otherwise? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_arrow.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2eaca3cd887fee74c351f16fb57f8e9f351e1e7112be48c326426612c4ed93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in the opposite case, aren\u0027t we testing... nothing? For \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_arrow.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a998dab4cb1f4d23690d5427a30ff201466951de3be7062bfca7b874506a1c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in the opposite case, aren\u0027t we testing... nothing? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_arrow.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26ce5132aa3ffe6af2c19a05807af8291cff78e29e3e53ad1276381ec713713"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use EA._cast_pointwise_result, same with other test files 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":"pandas/tests/extension/test_arrow.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dd37a54ff26dc39aefa0ac517cfe205954ea6735f9d2c912b05c1ce13f1664"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: would it make more sense to retain Decimal 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":"pandas/tests/extension/test_arrow.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdb92077ffb564961c55276c3d4a7b8cdb00557e625b1b6d374a529f53d5e62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: would it make more sense to retain Decimal 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":"pandas/tests/extension/test_arrow.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0b578cc14ff3ce568542e8dcb3f9e80778b87b2c33f55007bbe806e51b4c69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: prod with integer dtypes does *not* match the result we would \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_masked.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"275ac9e284badf25bc396942b4c0a0e9ff6bf4df20dd42de63b819d990f374a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Why does Window Numpy 2.0 dtype depend on skipna? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_masked.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ae8fc39a28adcaa40d47299ed630b0e3d4947244903b4950e2c75a62955845"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: xfail? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_masked.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cd0dc16bcaeef3df293541f26bd18f36ee9fcc5b32def2744bf9493c35f2e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: NumpyExtensionArray.searchsorted calls ndarray.searchsorted which \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_numpy.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8557dfce59f7682e4056746317230342c841f9be9cf8c4ecfaa557dde3b76d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: there is some issue with NumpyExtensionArray, therefore, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_numpy.py"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfb983c134a115e6b148bfeeffa99f38ab936e939c36f9f045bb501cf88883e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this fails bc we do not pass through data_missing. If we did, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_sparse.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cae4f2828fcb14891ed2359b320af3b26379ee9cda3007f1bc5424071aeb29f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this fails bc we do not pass through nullable_string_dtype; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_sparse.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c76aa7b1b2e6d702eee0e839cc40435b92f60191ce652af0fe7758d3f53db0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(infer_string) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/test_string.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5c88e496663638998c0c8c152f176f5f777b25bb4345fe830a4abd9f8fd022"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use a regular dict. See _NDFrameIndexer._setitem_with_indexer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/list/array.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62c28ba5d57e0d91237b83391ae5cc1ba54031881a59a2ff5b5357cd4ec73a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use a regular dict. See _NDFrameIndexer._setitem_with_indexer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/json/array.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"845f0d5cc3a459c88098c97871785fbfbe8d503862c1864da4f0187a1529350d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO replace with public function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/json/array.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2058fdb8c2d4aaf26a1ebb73f0dcfb7c479df95d4a377933c5bebc07cc60d38f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (EA.factorize): see if _values_for_factorize allows this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/json/test_json.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc28b2a47430d8b0dfbb252e33d85439ddcf679244d7d891500cef6f73562e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: require TypeError for things that will _never_ 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":"pandas/tests/extension/base/accumulate.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"304a22df7c575e71643e1f4dea5c0ee5b2ab26223e0e315f547deda79b0c2c0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is there a less hacky way of checking this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/dim2.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3478219d02f5c9e0f40c8127520fa24af634f2434ca13d182c78d919958991ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: box over scalar, [scalar], (scalar,)? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/getitem.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb2e9d9a075bff89c7f6c658cd1cee6aeec00089da1a250c261164f70edfe17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this raises KeyError about labels not found (it tries label-based) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/getitem.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be2e3dbafa4fcea56dd860836cf376697645a72cc1b34c7bb64f455994fe2a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: wrong place for this override \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/interface.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"17560b0928fdba0f00ffc50eb59238e3bc867bcf0e365de3656d5fda1f53652e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: avoid special-casing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/methods.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a15a6375445962f5d76b49d33927dbf482aa8df4f7a7e51ba8f075d8dbc1a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: avoid special-casing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/methods.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d008e66302bf4b9ffcf3bc0c7acbcf858e9fb50d000275e0f4ede06ce2bbf6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#44692): avoid special-casing"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/methods.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dce7222fca52a69597debcd95525fe51ba1ec6b6e36abc3fbe8cb9476e5536"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO the exact dtype here is inconsistent across EAs (should all be int?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/methods.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a486fc1a652a6fc369bc88ab78db6a388059516057a3b8392a4fc0c42184d8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: GH 57739 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/missing.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c379e36084796be18aa20f18a06d843342c3fef1f41c4897ab82fe2d4e56f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: the message being checked here isn\u0027t actually checking anything \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/extension/base/reduce.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"637fdf61721b6c1b06d12ca7e65db633076ffb9de092f143c84040af27f14343"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(infer_string) this test can be removed after 3.0 (once str is the default) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_astype.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c978ca0c961ce05ac9a8116117841eeaae51f5fb3d049216b3bd88578c53e110"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO fix in tm.shares_memory or get_array? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_constructors.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ed8301a44170319bc96cba4a2d9aa8b518c25a169c6c59a54f9d5522ed06a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW) block gets split because of \u0060df[\u0022b\u0022] = 100\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":"pandas/tests/copy_view/test_core_functionalities.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"baacbe8686f32aa216a563fc95d7bd1edfe93fbbcd338ad9fee04202ff3cee6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add more tests modifying the parent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_indexing.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7bc6d3d540de773e45e56c62ab7de6a9f831c798533ee0b213294d5d05fad1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add tests for other indexing methods on the Series \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_indexing.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01e448de793b2e7257df6560aa4adf884507b2af37f7ec8b87ce912f458fa9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW): Block splitting causes references 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":"pandas/tests/copy_view/test_methods.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"db290d713cc8f2535c82b54b209fbeff2ebc7f49cf9c88e2cc43650d9ac9c318"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Make inplace by using out parameter of ndarray.round? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_methods.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18eb632eb5ec27753f8dde73e34f0feb4c0bd2e9946ea6baffc099a1709bdd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Cannot rely on Numpy returning view after version 2.3 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_methods.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aceba747b57c98700ef51f4cfff27676061784f594d3b85280930e9dd801a58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW): Could split blocks to avoid copying the whole block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_methods.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b6483e777124b565808fea9ec0c5da0195e3ca4b0d6fb49a336c92c3d5c18e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add these in a further optimization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_replace.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb4079d37b4db36350da27a01130d6d32249581a0dc96c726b69b5f9ec348c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Block splitting would allow us to avoid copying b \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/copy_view/test_replace.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e86b1ba9b75d261c1d24d29433dcc6e0f48350dc8124e5a1fb3b8d137cc53e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: using range(5) here is a kludge \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/computation/test_eval.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d777e82fcde0b2eceda91cf0ecd2878298f44a28a2235e4d9343125d8dd6712b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update testing code so that assert_almost_equal statement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/computation/test_eval.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c06c229a5812450ad04dd35308cdbf21b20698c6431e9fcd5893006b5dc4ce5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: 2022-01-29: result return list with numexpr 2.7.3 in CI \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/computation/test_eval.py"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1ed66bcc43ff52e8ffa8dd2220399a411f7694f69a2d193468e288e562fba8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Should Series cases also raise? Looks like they use 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":"pandas/tests/base/test_misc.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0835f7918281eca0d4e1e2e64ef8a20293867b49c5392822892d368bfb404b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: more freq variants \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_datetimelike.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb8a3187068d78fbc7e03284cfaa093c75dcc16eb3a686c215ccd2bab5d5c6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: non-monotone indexes; NaTs, different start dates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_datetimelike.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b78929467508b9c2a84640c6212ccf78bac3cdf9f9e7874b990b00009c910c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: non-monotone indexes; NaTs, different start dates, timezones \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_datetimelike.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9245deda974a2015d95538b60c36f350b49c077938b9e8c2e5c70f2717a3ae0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: flesh this out \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_datetimelike.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea16f72c686aa867c45ac49facdb1196ba0a4e9b776335c23817cf3b964af4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we should probably get the same behavior regardless? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_datetimelike.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb3d953dbf8e10e4ba46cb88a2ea6123581dc9720fcbfac6ac3d5d06fc85b79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: simplify once we can just .astype to other unit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_datetimes.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc11708abd26bdd687fa123e86c5bc02224e1df64862fc78cf125b1715d146e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: tests with td64 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_datetimes.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd58925979d5b2a288a5f09d331659fe32933795a3eb627b05e9f7ccd7eced63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: merge this into tests/arithmetic/test_datetime64 once it is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_datetimes.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f20de0ccff443a2ba47471f12c0dc870889eb36e7d3d705f463d16be0ba9a88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: 2022-07-11 this is the only test that gets to DTA.tz_convert \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/test_timedeltas.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd5f6932082b5b7b4b80ca7f5b7fc6229f145416c0b1147a4217f78ad2f7f96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO we should infer int64 dtype 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":"pandas/tests/arrays/string_/test_string.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2992ca0ecb05b6ab6bb7e2c043ebffc566ca3cd6d53863057eb24cf37e1c9bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO ArrowStringArray should also preserve the class / dtype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/string_/test_string.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"f125bd2c53a1d7afec42bca10545053cbfe2a887ae277e9ee31ffe1c37290b81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: actionable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/sparse/test_constructors.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"af48accdbc8b21ce7d18b9a08608215e28c9120420810b1d9289d2a68ba2707d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: actionable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/sparse/test_indexing.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea0ab4272eaf0e7a05515ce4bde63ce115adc43be411ceadf8bd0bf00420af9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: actionable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/sparse/test_indexing.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"95635ea026d320b67c898e47750a9ff2bcf8da6d536bcfeebda3e0b5a464d5be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO also add len-1 array (np.array([scalar], dtype=data.dtype.numpy_dtype)) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/masked/test_arithmetic.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afc5d56b8f5b17bb03866963f1a6f2f9f0291bc41d0ff8e9729217873a3f393"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: so, so many other variants of this... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/masked/test_indexing.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"662f09e29478110fba594332974785291f935a1ee602162958280063002f1980"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: modify this test when implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/interval/test_overlaps.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"883cbe5014aa7396030a328b2e5b4ffe15b77ccca460de94355d1de7edd672c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO test unsigned overflow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/integer/test_arithmetic.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f391a61873946a964c3789a77ede52a414221e4ad130a7801df5947d1c363d57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: desired behavior when operating with boolean?  defer? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/integer/test_arithmetic.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10eccb8a2963d100226a6b12e1f880f8f03b6c67fd601a7d16957b405df0ba3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jreback) - these need testing / are 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":"pandas/tests/arrays/integer/test_function.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca70066eae47194defbc99508b7578147b936279c32b0c9fb0882158c842f11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO pending NA/NaN discussion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/floating/test_arithmetic.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6515bd7c0acc66294780ab3f6f65558d6afc2b9c11a201260c0d03fdb85b77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO np.nan should be converted to pd.NA / missing before operation? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/floating/test_arithmetic.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"53eb8a10868313f99ded6e3931e52bbbc9df019adb80592ff4fd3fdd9e07e680"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO can we specify \u0022floating\u0022 in general? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/floating/test_construction.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0586018366fa7e76e5d5848893e6addffa6ba9f64e4bcf51d103c14db50b82e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should this be object with \u0060not using_nan_is_na\u0060 to avoid \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/floating/test_to_numpy.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4193ada25f7e667adca334644f6ee0886fa3d1f0fed753ee16513a53f72c6a36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: raises if we pass axis=0  (on Index and Categorical, not Series) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/categorical/test_analytics.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9a2fea154f7fb42159123cddd91644116da079f8ab19a68e68436dd292966b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(extension) numpy\u0027s mul with object array sees booleans as numbers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/boolean/test_arithmetic.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a1c79e8f68af82f070fcf9aae93c8fa938cd3e586bce51fbaf68265fa209c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO this is currently not public API \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/boolean/test_construction.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d177e34273d272c1868abbedcbb202e6dded6cb5f62ea639f3c05aa94c5fe9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test True \u0026 False \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/boolean/test_logical.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0bda0c76f87530d35d1dc3aef30d1a90f0571c571b920b1f5ba6721ba79c37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: reuse assert_invalid_comparison? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/arrow/test_datetimelike.py"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7f265cc783855b0f1ec96329757e1e3f6992b5cc94a3950a9d7c9494dfbf26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: reuse assert_invalid_comparison? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/arrow/test_datetimelike.py"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff312f1b677a5c7ef79f3900a7dbaf774bd94027c08b8e811ddd7b0f3ce53e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Redundant with test_getitem_scalar once arrow_dtype exists in data fixture \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/arrow/test_dtype.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"971f417020859feba9ba95209474704c95c775ace6b843756bb47e4e9959ea7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: repr value may not be expected; address how \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arrays/arrow/test_dtype.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f85ee3930d366388a58d2c274461803f6f0150cde06c87a572f307b93fdd44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: moved from tests.series.test_operators; needs cleanup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90d338552718a42c9323aa52216898b6a24210d7b09fd8dc0a3cc9e2a7c9f36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: moved from tests.series.test_operators; needs cleanup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"298f7baa4aa8ba45ab1acc225b8f3ef1ee5575304a32fed277b2e782721b4216"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: moved from tests.indexes.test_base; parametrize and de-duplicate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d67e016b066cc2b868199e7fe947b250a4a6b8225a7e1b09fd137a36470ab6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parametrize over timezone? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecb56a8fbc542167062217a86b4d68de0ecb614992878e0873fab90b41c3d4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: redundant with test_dt64arr_add_sub_DateOffset?  that includes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1665a521e438098a1a1b92934e2e4523f03400a8db36170fbbbdd1d1b24c2a9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: box \u002B de-duplicate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"26292ecfb22d03c30458c3d61a5fa2bcc9ce90dc63a7169f05a2f8a2da12b2c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This next block of tests came from tests.series.test_operators, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce14564f2660035407e86de0d42fd7e283910db830c9cf990b2fedb0d295620"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: A couple other tests belong in this section.  Move them 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":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e9abe8606be9dd690b4466649bca0ce4b55c8ed0ca0c424cc422d9acac8aac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Most of this block is moved from series or frame tests, needs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":2406}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a46ba81d1777d12d1f65d15d4870459f196b904bd44187dad3df03ad7f3a4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Can we default to the ser unit? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_datetime64.py"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"43029a4fd777036e74d71db5967ebf6cb1eb810680da75cf949bc637eb17bc58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more  dtypes 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":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d223342491097d23584190fd03f55633fccfc4d698625b4aa0f01952fc477096"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this kludge once mypy stops giving false positives 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":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d35c320297402dbef8e7624ab395e0b20f08807e90c34cdbf44ea6eddf72ba8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: also test Tick objects; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6962df6c22aebe7f1f4ddc69a244130f302f5e16d37f91551c4dab075561d025"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This came from series.test.test_operators, needs cleanup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a602788fe0cc7ac9cffb0e02bf3dfeb8988c53e8da4fa7aa061b244ff74394"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This came from series.test.test_operators, needs cleanup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cbea2fae11535a8aebc15af2d9948791442d85ffde2901ba019a0c34f8047c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This came from series.test.test_operators, needs cleanup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"cade9c71fb9d2f6714e9b044de73afc448692c7445590f0788ab53878b42bd8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this came from tests.series.test_analytics, needs cleanup 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":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd50539e3ff3a76ad6af1880185d038065e91fb6a3993857380f0be42df79a2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: taken from tests.frame.test_operators, needs cleanup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"475002d07ef8b055a97703b89354371724c0da74473b4e6430ebbf3acd5a1eb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"468a8fdc05e9661b39ce462e3b9b6514e2407fb9ecbf2a2c7d4d2b4536b28580"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc02f5f48013f0bcb3ff47cd19d8d1383233f8d7ef2ed9eeed38bb44b2d5048"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24d2d6bade9bfb5b2c3743de44299838a10c4445c9f973f0fda818ef0f88e3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"3779bdabad37d97401cbc54651c827af11479b15518456cad1742ffc67ebf5d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: divmod? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_numeric.py"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cdfcd65a730b1e83429c3d031514505f76bd6ccc80d3ed5b9ef8fec8e54c45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parametrize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_object.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f92bd1113cf53417ae9d001774664017cc43a32b936f176261e441e97b1e910"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Moved from tests.series.test_operators; needs cleanup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_object.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d12fe3009d2437331a313bb685163636ae07fc7f5e65ed3489330ecae8dfce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parametrize over box \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_object.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffb801ae075d25c3cc6c3add9a653afd9b26df8eef224a6b3a36bacba276107"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: cleanup \u0026 parametrize over box \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_object.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7e5cc90c3c1a525bef5e05b21dcea39e4a5bac95b0455f93230e588014c0ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: cleanup \u0026 parametrize over box \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_object.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce058c1e195cc14600f1ba91ed5275f973e97d154969cf778743de827b1dfd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could also box idx? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_period.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8a02e4f5d8b7f734c560a1ef2e9c73daead6593e6bde282ab916ebbaa1b266"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Could parametrize over boxes for idx? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_period.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20485b46cc7e0dc51ff4ba3b7f031b0361dad1fa0b84e69353183a27cf2ede8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parametrize over boxes for other? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_period.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"4404bbfa07bc01d6cd5fb89345a96bd2782d7b3e362daaa45b36fe1e17d938be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parametrize over box for pi? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_period.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59302711ad9313f8e803ff772e34117dd0fd9167ab0e846250be4938c12c5f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Some of these are misnomers because of non-Tick DateOffsets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_period.py"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"45942dcf30e49fd63d0ca22a8bb40bc407922dfa719ea5116e9e9fd7ed608870"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: All of these need to be parametrized over box \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8627edd8e17d7624c1afcb34ec5a21f14ea4afd5a83d4b924e6fb6ffa1f0f5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: better name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca1021ecdbc6500b4084b4f2e0f1b38c5cb69f9fc9daf51b96fe305f3e120a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Needs more informative name, probably split up into \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74fee0d99c7267bd575f5f73c3c757ce8bfe37ebe5a365234b8b4ad5e1cefdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parametrize over boxes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"6949a72428755b4d3a2125dfb894d0a92a4f03ddc2b870ba0875e10d423ca1e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Make raised error message more informative and test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8643dae2a68e3f1489a5fa98812fb41af3b7b7024cf38c19ee12be7ef3961ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: moved from tests.indexes.timedeltas.test_arithmetic; needs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"76357c91117cddfd7bdc2923921b33d98c6c3e22de943294f668065516563a20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: moved from tests.series.test_operators, needs splitting, cleanup, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ef8afb0d8cb4cd37193d91e2ebebbaea5156f33e174cdf2a20c10d61506990"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: get inplace ops into assert_invalid_addsub_type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f96fb076749c32bc64a4e284331f46592aaea280c5cd78974f8a589350267e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Put Series/DataFrame in others? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbd623d973a336ef37d957ccd3ddcb613ce8fb18639f6faeb3d2b5335ecab9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: operations with timedelta-like arrays, numeric arrays, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a46d572bc0adc4d0e50e3c75f01671728cb54e969bedef1b2d31a6d80533c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: making expected be object here a result of DataFrame.__divmod__ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acb61d0b64f43f310ae46ba88aa8b137ed606e3d1adfbf1a7384c1026dbb86d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Should we be parametrizing over types for \u0060ser\u0060 too? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"483c1dd4f362a12775debf8faf0df905603080c50a6271057ddc8135d75bedb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Should we be parametrizing over types for \u0060ser\u0060 too? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/tests/arithmetic/test_timedelta64.py"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72699fb8e4f22d9854aad67fcf27d620be040deeb385e0d04a9f8b641a8e9f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: dict-like apply still drops args/kwargs, which is a 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":"pandas/tests/apply/test_frame_apply.py"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbb4a666e2fa6f86c393c7d9c9b12141ffc7fda551111364448613f1fe72df8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Check the following : is it really info[\u0027fmt\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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1525912d93816d24246b7fca1383fb457abd6861e68e289224a200f5cdc00fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Might deprecate \u0060column\u0060 argument in future PR (#28373)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fdcf3242af1b6b5c95658bfebccb570b5bc5ed92067edaca39e229ba204274"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deprecate fig keyword as it is ignored, not passed in tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cd7ded8fe18c1501f6788fc1585efa39e1e350fe8c4cf99465ef5f7459dc4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: also accept indices instead of just names? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3da1f4d221735eef271b9a3e06bf2981bc1c67fd74db5626f0d77c38f064ddc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use Matplotlib public API when available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1b30fc70943ce3ed51c69092a92f306edc8c46bbd8209d5c3b6f5a9b02d37d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be56dbf61dd5265a04cf06955668eaa68556eeab079fbeb4b5696fda8f98042"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6662f3cccfab405174316f99a7662033483ddab1a627c690605ee73727fa00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"b144d8364c828a72fbf98da956dfcccd81e94830ee3ff5c895a860816db7820f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2174227546dcc0c0d5d93859aa907cdecbab02dcc5b7ce6110ca8360f71fd34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c63b9a538fc463d048e515788e482410e8e120737e80f55845c6b74d2b4eda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dbf3769db76618172b0e5dfb7f24b3800f66478ffa2e92587a1b809ea943f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5c1a5912f48d8db633235d64413d822b89b1cb875dbcba84e60764b3d70147"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"52644d57eb76c1f6ece55d48d542194c1d25306b419a6bf30db2a7f50f95acef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"004776f7a11ca1c202e1e9b46e1fda4578a5fcf64d1200936441140dd5d3324a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6b4e179a3aa3d2f8c9417600690f2abf23270231f69916e5b1133dbe4cbe3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea639b527b616be2fc932191870f7ed87f00281d55d8f6efdca737d2421567e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9d067139873ac441f0dd82277fe98c0928f527c12a6121adfe9ea4edbdd5e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"330fb41d36efec0e943bd16ad38bed63bd4acc2f849c8df954ee8e1d2783af19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd5847f4455a639c88683c4ac49a26df621e64ed3bd427d0639a4650aaddba4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0618255d50b34dbb9e4b36ae96ce8d3f96bbf4943304416c0d5c8602cde9361"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5631e20a6f789bf379af8c64b1de2201463369e6c364689c50eb9a31a56e34b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4977767fe9c0cce4ddc4ae6c89627823b17e21ff7e4b1e6f9b01bee722cac3a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccea5d7a45226aa3b06f5b5876ce071aabbb31e4de80d6935159a1025804dd0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b321e4a8af61263169e6b74e1388cbcefb834fa2b883a3ba99149f8b468ea1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ece5afa58c85093f0c33846395a3e93ceef14ec57161eb85ba1c662b9b3e9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe642f3aa176f60f51b8e416ddb9b3f0724192dd4423f9e55b3627bf3a9117"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO #54485"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7718e7ab7eb94addcf77f505c1c7d4d5f2cbc4e1b2090cfa468dbbcad70155"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we annotate this as both a Sequence[Axes] and ndarray[object]? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e0c66f0898666e2a53291842ca2f3cec7b9db269920638ed44b670b4930df2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: change after solving issue 27881 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7247323023cd93780fc35daeef2fc233848e9d824ffb571c27ab62eb18eb23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: be stricter about x? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dddfb948597d4a363cfa88bbca8125ceed05e5a29d571f637e00e76b5165ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why do we need to do to_timestamp() here but not other \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de50cac4bfc27924fb1bfdc4b2f684c3a8512f3141ecc1eaadf2e1ad2b26b4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: tighter typing for first return? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10ac4ea2ecc8fcdbd14487c1fe6161dce6bdec8adf0a0addf1dfd6abdb69d63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: warn that we are ignoring self.norm if user specified it? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6ba3de104a818c4ff530520a91141a206a3d413c56b20b9a69f26c1bee4e6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: GH28021, should find a way to change view limit on xaxis \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca84a33aa2751ecefd29f15ff87732115b4944e7a479c1fcaaecfab0bb4a928"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # hack until the plotting interface is a bit more unified \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":"pandas/plotting/_matplotlib/hist.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbee9eb3fd4a9b046073acf1f567593bd66d3fde6f8dc7fa66061ade05e196d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use the fact that axis can have units to simplify the process \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/plotting/_matplotlib/timeseries.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf2ae0144f056708043b6fa4e99106d7613dbc8d08271b4a323aea72de9defd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: fsspec can also handle HTTP via requests, but leaving this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/common.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d945d2ccad03f84bc31bd3b187d003da6ce8ada3f07150e7ba52203caa6167"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK: lxml does not clean up the clearly-erroneous \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":"pandas/io/html.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e6f83e774767ce7ab2bc052f884d923cbd1eff288b8eabff03ef42053dc744"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #  _table_mod.NoSuchNodeError.  TODO: Catch only 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":"pandas/io/pytables.py"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"def4273a6aa4c4da2736d0e417b2243a0fd0e69d0bb9038347df560768504d35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): not necessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":3172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d03e46d2dc07b96ed0e07a4aa0d4611b18f1efe1f3b3fe5fa3cb96613d1d46b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should the message here be more specifically non-str? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":3394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43dfdb9cf5e5ff68d6dddf90269e235a4081409bfb339536a94601de57c1f65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should the message here be more specifically non-str? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":5063}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a710217e9300ce64eacb43621a4a3cfb8820f0795ffa5aca49b695409624134"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why kind_attr 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":"pandas/io/pytables.py"},"region":{"startLine":4597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf373fad67e0f017cf53dd0c381878a50ccfc8e38de07b70d49369f3771b228"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: figure out why these two versions of \u0060meta\u0060 dont always match. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":4605}}}],"partialFingerprints":{"codehealthFindingId/v1":"5560cd45cc04c562eb61bce41fc3c7e093a0e1e5f384e01db1ed896790e9c595"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we always have validate=True 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":"pandas/io/pytables.py"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17294bcea95307c6016af16ee65117d1aedd74388f23f6e7d464e380dcba350"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: get this into constructor, only for appropriate subclass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":5180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb6d6c95ccd1f0182720f82b302f4ae8f6fbb7b959d3db02357207015025b37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: prove that we only get here with axis == 1? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":5207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd338e888a95f30114123b6ac38314cfeff0b2cc0b5decc48fb730a3f073b401"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # hack until we support reversed dim flags \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":"pandas/io/pytables.py"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9624b54e5bdab487bc3a2b893b16d96fda58b6be7454282eb8f3bd94b6c461"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we get a typ for this?  AFAICT it is the only place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":5913}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01ef7c7e12c76652af726e7de6910aeb70528aad6ca5104ccac155ef575a087"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # For datetime64tz we need to drop the TZ in tests TODO: why? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":6571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1b8c44dbbde5f71c38d658f00838eed13711e1d7b3da98a311cdcec6f124b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we used to reshape for the dt64tz case, but no longer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/pytables.py"},"region":{"startLine":6578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3eae213d7418708e71889d50d03c93c4fb0be174de129eeb1544da1770efc0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO could avoid converting string dtype to object 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":"pandas/io/stata.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa345bbe42e9594b1cfef01df94f95a8ad234d9d121b07d98aec2ebd16c67be9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we fix 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":"pandas/io/stata.py"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"603626048816870ddadd8c453e133858ec9e08eefc06cff685375e90aeb44a5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if we get a non-copying rename_categories, use 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":"pandas/io/stata.py"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f9dacfeedb9134f79f85d750e92631c6ce94006efcd6641ea8643ad1aadffb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is the next line needed above in the data(...) method? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"f025273febfa3404d9d796a6c4ba7ae41d6781d47f9c9a7aee11341cd551078e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: expand to handle datetime to integer conversion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eadcba290841f45b7d2b302d9a56a4743d3e0c59f91567171506b2a009e09da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: expand to handle datetime to integer conversion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":3221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba98b926b72e6c7570b57f151095e9f3d79df9866ed5661050af55290d14f71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refactor to combine type with format \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2b08387bf20a5bee0c3f83aa707917be9beeb4e8f0ace9cd9bd5fc493b7257"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: expand this to handle a default datetime format? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0794799aa34ed800871f3c46f71a141995b263c55a312c26896ffc17a87c223a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO could also handle string dtype here specifically \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9ccb9e956beb7bb4a60cea7f372529a358aebb0673bb7fc7365843c431e14f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # xxx...xxx \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/stata.py"},"region":{"startLine":3442}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a5bb70456d0d60ec0a5dfa4256e1b9f03ef8acd377ca40ea09e9f3c811006c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Arrow still infers strings arrays as regular strings instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/sql/base.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b6f47872c42f85a7c42fd30b976a0f32f87595ac2e7e65b92257e4fc6cb616"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support for multiIndex \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/sql/base.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"651709b95d3d9fda337e3b89d05742e60dc2da385969fddefa15fabca21b723e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refine integer size. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/sql/base.py"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73c052e8c868a4d07614c3c8f5f9021f7be91be2bcd9a79da8887dbeb57b061"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: We could return default_index(0) if dtype_dict[name] is None \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/base_parser.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"92207d7c21e330f70a95504498740b34b0d33522c119597afd4505e6ecfb3a40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why skipna=True here and False above? some tests depend \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/python_parser.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5adbbb3a1fb7dd4e1efcef4147ff6de6419345a9c66febe7d639b435878057"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refactor this logic, its pretty convoluted \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/parsers/readers.py"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bdbf0ebee4413d652575519cb6dd2aefa7d6e4715b52062faae06eb1427e66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Do this timedelta properly in objToJSON.c See GH #15137"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/json/_json.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"decd4c55019837d2038c803296722640c9046914ee6a5b02f72ee63856f5d9f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle record value which are lists, at least error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/json/_normalize.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4d5c727b37f963cb7f738b39b3a51394b5599ad299dd06bb9381e00c444c35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Can we use current color as initial value to comply with CSS standards? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/css.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a43f4ce13df03e871e0b6fc36bb2d14048b075d657e4f4d5d2f48e9269e92c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Warn user if item entered more than once (e.g. \u0022border: red green\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":"pandas/io/formats/css.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e049ce086f6f55329b9fc2cd790f722336ff400e36d41c7cc72cba33b9808c8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # 3. TODO: resolve other font-relative units \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/css.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2cce82dbaee999a756c5a9f34ba87217962e13e0ae6615f9a34390205093f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support % \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/css.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9112478219eca3f0886ec397b6c5a61a7a070ebce4adecfb665534c46ab6c9"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # hack for \u0027large\u0027 etc. \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":"pandas/io/formats/css.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9633aee124e49f0d803adcd0e112cc3d745e931619583d226316759b0b0c3ff1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle cell width and height: needs support in pandas.io.excel \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/excel.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b62129cc45f86aabf14ac4b256acc0c57d99a674e569aabbeef817555303388"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: text-indent, padding-left -\u003E alignment.indent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/excel.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d1b340529ac5fc2400dc5dfdc134fb06ea94f6ce7e80a950c94e7b72adb1e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: perhaps allow for special properties \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/excel.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a8bf23822a370b68d4dfcccbe47b16b176dc2a1b883a73a0edf81d60f13bd2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # xxx\u002Bnanj \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/format.py"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c4725dea83158a7f354fec3485faa91c691830be719d8a47fe61367b4eca47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refactor to remove code duplication with code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/html.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cea0cebae6407f7f60114ab6dc3f4a9813b30642166d2857ac71a22f824297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refactor to use _get_column_name_list 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":"pandas/io/formats/html.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d32c68d18ba07a43c1f2ad45c107b1820ee7c638b58b9a85362cfbc06ecf023"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refactor to use _get_column_name_list 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":"pandas/io/formats/html.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"5280e88fbb34b004c8bd10b4d2725cebc3197e8cd505c8591c4c5c6d39145b5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refactor to remove code duplication with code block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/html.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"457592cde9e607f2dfdef55f798a9a764d4101d0f521227a7c80f8e9cae40740"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should is_scalar exclude np.record? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/printing.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"047160be9e463a8d2014d10292291c8545ba4875c7db07efe882e22b81af5a0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO try to consolidate the concat visible rows \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/formats/style_render.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b65ddcfb973ca628ac0535d0b1fc1740f66d9959432de62f02e0c554d8a7e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: hack in buffer capability \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/excel/_pyxlsb.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"910221b858c2afaa471fac78396c0874be5d30b83c187026eda2a1491d68ea24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: there is no way to distinguish between floats and datetimes in pyxlsb \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/excel/_pyxlsb.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1b3d2d6457322e310ba4ff67eb29e2e879d302d4d47bf2479934cce51885a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support other fill patterns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/excel/_xlsxwriter.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8715ec9e160d295e058f20fb7be5d580cf877d90ce29212bb074dc0a42423236"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: https://github.com/asweigart/pyperclip/issues/43"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/io/clipboard/__init__.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"170f57ca6631f39b66c6b76500ff43b26470ad843b50ad4b24c603843c12f2e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO - split this into \u0027qtpy\u0027, \u0027pyqt4\u0027, and \u0027pyqt5\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":"pandas/io/clipboard/__init__.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c4b29d3e0c551a816a72a4c39a63c106e7e52f0ad3d3752fd236f7c508bbc2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Share with _find_common_type_compat \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/algorithms.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05f3b3a7b0a3a2716c38e4ef414a498c83f1401a7618121544cd7f94728a52f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: not quite right ... Sparse/Categorical \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/algorithms.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ce9bf40e509eca0f307b0e343c07b6ea8113bdf3cdbeec3c3974ac570e283"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: require axis == 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":"pandas/core/algorithms.py"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fcd3dbe72e583c877462330fac81d3bfbc3090d4beaef79c164dd9ccf8a237"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can diff_2d dtype specialization troubles be fixed by defining \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/algorithms.py"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcc584f792173ccd8e6dde105b67037174c47e43ecd306552dc6a79adccf279"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: dropping args/kwargs here is a bug, but forwarding them makes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/apply.py"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"801318f579180a8a8ec66b46da454a22ceb6edb8abcce64ae2c5fed93b558a04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Avoid having to change state \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/apply.py"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e579136082ca064e31ad4d374e078e93fda5570d95fac8f3e295d437abb9d55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: mixed type case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/apply.py"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3dab0f99bcb0c15479cd1535af38a368bb2a4b860694a3ff46f5e7dc21799b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: GH#39993 - Avoid special-casing by replacing with lambda"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/apply.py"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dfcc6eaa484822f2b13046051d8efb727cb35f71ec24db0ff799fbe203279a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: values corrupted without the copy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/apply.py"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22a3f51e38e93af7c64fea4a5cbe9fe8e4527898916c89178f1a2e2b3539472"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: aggspec type: typing.Dict[str, List[AggScalar]] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/apply.py"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5ea8bb10c83e3ff653966dadb0bf89993086c6307e0c8542cce62f1185284f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Can\u0027t use, because mypy doesn\u0027t like us setting __name__ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/apply.py"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"474f37399a41bcec5577ef8407b8e0e4a1e5a5e872e274bc9cf0073d5a6a0293"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: When we support multiple values in __finalize__, this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arraylike.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b25f5dedbcd98aece43d6842f68c50afd9db46b1e99cfd0dc83bc13106796cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test cases where this doesn\u0027t hold, i.e. 2D DTA/TDA \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arraylike.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"b014c7d48aacadfc2d2bfd095b1c074b4ef406c79be34beb9bcbcd919ce50f40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: used only once in indexing; belongs elsewhere? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/common.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fd263712cdfe73126a17942aea7c6dce60a012c1fc07868db26afd30889157"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test cases with arr.dtype.kind in \u0022mM\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":"pandas/core/construction.py"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d53782336afd97df8f1fa37cef73ac5d0bb0fe68199caebfe12ca6ea37a053f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special case not needed with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16b10779e14b7c1f1dbd6e2bceff96d45f0fd60517d1d104f3c1c87da8a4780"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special case not needed with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":6814}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ab2f9d63c634c4f0349fc4563c16a0de8175fb388eac02325e32e8f2e0308b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special case not needed with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a13ca0d6fabb1453c674bad28056747cc5a418847bebe8be274035835fd7d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special case not needed with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2579}}}],"partialFingerprints":{"codehealthFindingId/v1":"738981e8f23edc6f6d0c08ebf6aef132b79f9cb064e8cc6ec605fcfe30d7c209"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D) special case would be unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c81b5ed64fd9141985282e9af7ed9647ceb8413e7786f57a2c7a26fcfb2d22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO speed up Series case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7153a455a58e6e3fd463a62510fb7c3405461bc9d5bc81677a99aa018b7e02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: a generic formatter wld b in DataFrameFormatter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":3434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52791a6407b1f348d3693752744c47c87eafb210d9be2f62df63bee2f578196"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): doing this in a loop unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":7680}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e3830d8790913035565e3b2e571f11c74aa189ccf12e0b672f1c34cffca935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: The previous assertion \u0060assert right._indexed_same(self)\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":"pandas/core/frame.py"},"region":{"startLine":10246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6369eb6f1e17e14aa3f6b5f6064289eff893200a0e664f1bf7aa39d158bca5c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: any other cases we should handle 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":"pandas/core/frame.py"},"region":{"startLine":10382}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab5ab80ac16eb691e21fb581901113590cc50ce54aaa133b6afddfc545262e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is there a shortcut available when len(cols) == 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":"pandas/core/frame.py"},"region":{"startLine":10391}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd83d16e61c17f0eae73d71d734b9296b19285458322d34197a2350fff4dd015"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): no need to special case with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":10559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a8d5d28e5785e8d87c083f541cc38ec7808b5425f09d4fd219fb47b750b6de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support other joins \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":13589}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b68ca8195d479e116d4cdcf68e87d7be376aa5e6ba813b17ece1ca65f2f27e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: also the ArrowDtype analogues? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/frame.py"},"region":{"startLine":16402}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe75aab6363f2811d7a76d2150f4247bf044fb7d3a0dff135fae20c450a82a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: also the ArrowDtype analogues? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b1660d289f244ce3a3675867fc32628b80f8334e2ded5fb3ac094e6fc6410c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Decide if we care about having different examples for different \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":5537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1145800abf78246123dfdec1508d4eda39a2d9ffb57565605a380e363cc93af0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: speed up on homogeneous DataFrame objects (see _reindex_multi) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":5659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e5f605eca00dafbe5cb7af029f90b5ef4e948f7dbd5c15a1a636c4f5059498"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): could also do this for NDArrayBackedEA cases? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":10524}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80a6e670a54d393452ef9d23b820e2b89a8c2b3f2920f890fc3ee62c554e5a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we use a zero-copy alternative to \u0022repeat\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":"pandas/core/generic.py"},"region":{"startLine":10542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42ffbe1ec842cb336b098164e2e51dc3cb76e1681fe81bf57ffbf5fe4e772ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special-case not needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":11877}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf856c8d25f2b5b4fdce1c05b194579245251beb17cb2a55d8effd805726a14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: other cases?  only one test gets here, and that is covered \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexing.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ff0f62d1ef56842bd71b4cc25f3484e5cfa5d73d8c4a5c7de6bc5e54f881bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA): ExtensionBlock.setitem this causes issues with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexing.py"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ac151fcdf45f6ecb2224a8224738bb1f841e1793555cb9b746d139fe3c1603"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this should be done in an EA method? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/missing.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"097a6896ca25a2ae15727e6da7370e5d5dc83fc52581b9dbb9c23e83b7204e58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test_resample_apply_with_additional_args fails if we go \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/resample.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaae33e6059f85517132409eb6caf7c2d7ad88dec6b292c6f485fe47222ba012"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should we disallow non-DatetimeIndex? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/resample.py"},"region":{"startLine":3251}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd9ee594b9accb6588cf02260145c450797cea6dabf3a545752f7f4fa5942b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO bump this to stacklevel=2 in a future version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc00e9d9a1bd9a7cbe59bfa95491ad08f2b43b1134af9800cd99eb5f7730be6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO bump this to stacklevel=2 in a future version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccecfebc77e42e884b02fecc441b26261610fabff27cbdc9203f71a77f3c63cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO decide on read-only https://github.com/pandas-dev/pandas/issues/63099"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa616b5978c25479b2f316721652edcecca57b16aaa65043045b558b789958c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO decide on read-only https://github.com/pandas-dev/pandas/issues/63099"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ad3240b236cff96d7c82ffc515c54a6a8f93431e029efd61c1d19f348ffd13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: integrate bottleneck \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e77f5bcefc4cb15f248b6fe7eacd173b4a1c978dd21c8868d651d46d5292fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add option for bins like value_counts() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bfe90e6fe9b195f0e91e1866cb953ca3bc36f7fbfae1ba66777f65da240a0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: try to match resos? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":3952}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d37b1df9714def75e1f85ff9e2675d3c26f80b49e58db55926c1d63901831a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Different from DataFrame._align_for_op, list, tuple and ndarray \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":7468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0d815e8740ca30a28d2c5ab166c908786ab2c9d109270bdcd2857a3d497b8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: result should always be ArrayLike, but this fails for some \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/series.py"},"region":{"startLine":7575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bf32a62ffb0e00b85733758c52c4c80420398d7503cee2028f678c368d04e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: sure we want to overwrite results? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/window/rolling.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb86ee77eb08ae47bf64a215f8ea77bf1e30ef17bb35ee7d52dba3dcc20d175"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why do we get here with e.g. MultiIndex? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/window/rolling.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5bd7788a980e9bd92bb54ea40b52bae5b5b710a70ac44608c8b23e190730b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Could preserve correct dtypes in future \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/window/rolling.py"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc48490f10f211517b91b35ed96bb8e769eaed585812538969bdaa180d0da26b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Combine with above if DTI/DTA supports Arrow timestamps \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/tools/datetimes.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"03445b611286aff75e26c7c65161baef9cd91dbb82c034fee2104d345dd24823"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: avoid this kludge. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/tools/datetimes.py"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbc5ad9b7f9adcf41ca6bfb80a3be9c49522521fef21beb3a785a39609075ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Dispatch all the methods \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/strings/accessor.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecacecc35f3bec656e9f3d5f8e5f5f99651ec43d0407b3d8757d33bd8ac284ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: dispatch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/strings/accessor.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e815be75e2f8b7b950c0cf0d5e7820ff995bc87a4ac762a61d10d803808f43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: dispatch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/strings/accessor.py"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f852b47cdf8edf263304d49b4301fde3ad8d487b2edea72dd9297e35759fca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add a similar _bytes interface. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/strings/accessor.py"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46bfb02dcfa5bcc07f5dc76867e410f29c61e6aecb2a8ca153f4afe2f39b58b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: anything else to catch? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/melt.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"9444609154c7a5d6ea7cd6c8e69bc438e46224ed8d9ec7fdba18528bd721de2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO, should merge_pieces do this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57f569403ace9f770b234faab380e9e27d630807b19806dbd43e86fe34944f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: transformations?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c3a67fec2ced0bd61d4fb4c23a65eeac40f99d8ccc9486f5f0a9028dbc30d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we pin down take_left\u0027s type earlier? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c5578b7d2a7f3fdc8a0bdca98579e4c942f1d200fafa3b082ebb2c40e71fa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we pin down take_right\u0027s type earlier? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"322f3f8a4918171d36c310b8c531a0e385faabeaac10774f2cea891f85160550"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: what about other NAs? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"75459428c60dada8c428d6e9610b1635b258741e41399d2bc206b7ed8ef7ac5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why do we do this for AsOfMerge but not the others? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"39533038276bdd78b6b378b6a9b3367bbadc738f63322a943669d648a445b1aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we reuse a tolerance-conversion function 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":"pandas/core/reshape/merge.py"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dba0834f810932cba18e74c67106b80baf3bfef058759838c4cd0b64121a94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we have no test cases with PeriodDtype here; probably \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":2685}}}],"partialFingerprints":{"codehealthFindingId/v1":"9551b7b108835ba04521e3625faa41ced834c6f83ab4384ff87e9af6bc343371"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if either is a RangeIndex, we can likely factorize more efficiently? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a94c669e647b20b7df043951c45aef29b437160dd3dfdb12deaa074f296f6b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # GH#23917 TODO: Needs tests for non-matching dtypes"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5476eb3c2a2e3fdcb253eb62be439f935e9e356b707452bfcc282fa522c58cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # GH#23917 TODO: needs tests for case where lk is integer-dtype"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":3010}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f18b5c39028a41f681c613a42bdb814d026455a7da81f629ca01a1ddc73606"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove when we have a Factorizer for Arrow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/merge.py"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"e059bb054d154837ca020cbd665a238dafa957b6b003ac4caf3eeb9c5fd3b8c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we avoid this?  this used to be handled by \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/pivot.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f6c386ebe5447ff606734bd373bbc2cded59b79ee8a6a97545f0d4a0d4501b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): won\u0027t need special case, can go through .values \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/reshape.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d197c2f4d97a6fe87f9840b01d5cccecfe1ea7e51011056c40dd793d9c4066"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle mismatch between categorical label order and pandas.cut order. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/reshape/tile.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"56096acd42d564f22077f47070b3fd68727b11487700d04088cbd5cca970339a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can remove this after dropping some future numpy version? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/ops/array_ops.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f317ed142e3d313a73084f90ad50691b25111754688bcd6b2e5418d856f2b6c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO we should handle EAs consistently and move this check before the if/else \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/ops/array_ops.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca30c3fe9ebd667e11bd82b99129ea8ff824b94b6f05769a122a3a296ca30ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make this treatment consistent across ops and classes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/ops/array_ops.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31b8f9a3c3a571c749002759d0b7b60cf70d60a85f628ec76bb4c56f17393b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: but not pd.NA? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/ops/array_ops.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c4f75a7bd419ec4c934c7712e88a729e43c77854c46fb549c7f2e2cd1dfcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7d814c9d3568fed7cba583d1f94713dff1b9aa77354daa627e84397f8ddd14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3c4f9a85215c5f243207dc1c1cabe2b586bfa5e37eee2869d6d0ab331f4dbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64fdcd5dae9c478321e45310bdaa39e46dae71775a873edbd144c9615e3b3a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW): Maybe split here as well into columns where mask has 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":"pandas/core/internals/blocks.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"51062206c950c85597e2bd29aab0d7267c01fde1ceb1e6a64a5e560476d32b5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW): This is tricky, if parent block goes out of scope \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"690fecd03150f19040d46a14cc3a36bf1c1c44b7399b1ff7bd76b4561d37ddd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): reshape not needed with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"345c1a00bb2ff118fb1333730d377b250cca24a6b5adf3c55b93952d627c5a97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): override unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"62162d2be1fa3b4f4ae91d1e96de2fbfdedf08901da6c137ae7daa1b40292524"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should we avoid getting here with DataFrame? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c6205062c7ffbc854bd668bbcf7b731f7cc66a712600c3701360e02089d66f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: ATM this doesn\u0027t work for iget/_slice, can we change 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":"pandas/core/internals/blocks.py"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e816cbdc9c0bbc972fc8e6c29ed39da7c12323bbb2df8e52616975386bb52e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): not needed with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"33996ead265ea99888d63f9866ec768a9c3da98d25dcb9b05b0ecf86e2d76719"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): won\u0027t be necessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd141f80dd9af920b398c1d089ee1ba0231061a1d71a8203123b4d40d99e95b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): won\u0027t be necessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5564235ddcdb7497d6534c7732a9700aa9affc2fab3f1d8d5c08e9881e3a7650"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could cast to object depending on fill_value? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa62e4e46579c30b3f5b5260effda4e85e02c88d21d6cf7f0ffcd0b4c139c305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special case unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac22927948fb2404ebd1063fcbfdf8423f86fb3afa74648eda48d491303c290"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): https://github.com/pandas-dev/pandas/issues/23023"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/blocks.py"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0493e95ab18bd0df4482955bb5be09fc523623ad609c927868852db667a72d00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support more dtypes here.  This will be simpler once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/concat.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b5f9f17958b18f932aaae09b425ca86d4e4135056de6a419d3dc99ac1163cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special-casing not needed with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/concat.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"41115653a130771370074e7929177bd9b14b42f3b21cfe93a1be8c595a97603e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in all extant test cases 2023-04-08 we have a slice 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":"pandas/core/internals/concat.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d58b545481810fc0b4fac7cbeab7d7e7aa8be43ce70b195f909a43e67fdd55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special case not needed if all EAs used HybridBlocks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/concat.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"533b08c00998360d652310622e35ff11c101cdaa1c4adcb94e380655444e0f17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check len(values) == 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":"pandas/core/internals/construction.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d336e57da10b2090df231ecffc937ee18b3a05ecc5c1da4e948d2ff039fd1e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check for length-zero range, in which case return int64 dtype? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/construction.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1207b3e06fdd51ddb35a0af38d202314c270ff1f2c99328f19d1c8a5667b1eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: reuse anything in try_cast? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/construction.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"381db8bf295b283bd4882dea8ea424bc45b19eb0829bcc4b0225d5b534dba67a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: is that an issue with 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":"pandas/core/internals/construction.py"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfc4755996acad34e945b552cc1f5ead73acd5eaea1a3b68007dc601baa7ae2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test(s) that get 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":"pandas/core/internals/construction.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"81037a1ecb5bf883f3f64f39ff565f0b9d9ba340bc8dbc38cd8265e65101f063"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: try to de-duplicate this convert function with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/construction.py"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d077d4c5ac5418fc4a709e30829afc109633220b4ed5ce793214773a7f26ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: https://github.com/pandas-dev/pandas/issues/22791"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea805ab887b2b74e94aee4ae7b2e5fa15ede40d766cf5d173f294e2247985e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO shallow copy remaining 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":"pandas/core/internals/managers.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c845f55ea266263152195dcceb7b10d5d13f41e6d316ff94cef29dc699fea91e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Deprecate, usage in Dask \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5021bd90d905e61026f5d2fd67f6aab2f1f61a16cfaac8f607ddc912ca0d96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW) need to return a shallow 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":"pandas/core/internals/managers.py"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd09042ea6ca7f26c2c6d8b09c86f88bf50198a7eb11fd01a14ed3d100df8535"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO shallow copy of axes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9234b8db78d5ac2da04ec47888367219d070a90e07b04ed75d59553c16f9578"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Should deep=True be respected for axes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"259de07380a75a6aa13e81506d224b549815ccd02ce5fb6d7a319fbddfbdeb49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO shallow copy is not needed 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":"pandas/core/internals/managers.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"989df3472c6969db2b25f5333333b8297e1f53e0c2f2d0922f81f0e6f02f0273"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW) need to handle CoW? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbaf1d52ef7ef3955b21a96b0be7de0cdf01b7d764544c6754c62c99d337666"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special casing unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0463cecc3199fdc76ac18784f41d7dedb68dd6d29e601d5bebae4f0399e671"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special casing unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd17d54f2634e5a5a48ba4a2c7beabc40d98ed4900062c9c4b15ece2ffac842a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this could be wrong if blk.mgr_locs is not slice(None)-like; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"88da97676bf372c8bbc8776eaefb2c7f0674c79983cfcbcb3c88133de74612ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use object dtype as workaround for non-performant \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fd1da2ae912e974af972b271152a93d5ee683b0a1307b897d66914b690d0b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#38240) this will be unnecessary"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a638f0334b2bdf8ea0a21d115989d442b7249f8ef7a7ccbdc6e6c4fbde0832"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW) making the arrays read-only might make this safer to use? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2063fc027366de445900ef3535779e5e7636c4fb67120d602ae7454860142f4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): special casing not needed with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9f2b032a17e52bdebf64d036c7b628cded392bf81c9d2aea7c9eceacf46fdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: fastest way to check this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a95bb9e69451f2f22144b26962a3a7c73cc01a132d2086ba7ebe74908dda47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO shallow copy columns? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fde18b1315e708ad627f40090deaca71f79fff77a8b800c4512c415542445fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): the combine will be unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f576b6def7eadbfe18f9ca230b7adc38204f21c57bd774cb9495c1863f172ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO relevant axis already shallow-copied at caller? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"799cc7e64319029e7a8830226212475581b7823cadbe09c4e8b72090d66cd501"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): ndim would be unnecessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c854c4c875f2ef36c29566cfdf40fcb43456fc029bde89d28b0db73440128b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(CoW) in theory only need to track reference if new_array is a view \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bfe3d682bddae5ba838161ba3558ad362c7aae597fd5ad848b12959adff859"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO this method is only used in groupby SeriesSplitter at the moment, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/managers.py"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc0004946deb85772f4c99fb35964283ce484ef15a17b75d270a6a8c43bf595"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: optimization potential in case all mgrs contain slices 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":"pandas/core/internals/managers.py"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd2fca28ecf0662bf1070ebdd6a4bf5d0ae10dc7aa5f6cef496f0ca7868cb07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: no tests get here, a handful would if we 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":"pandas/core/internals/managers.py"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a53c9330431a096c54b061f3e3efb723c1f852d453b62c7b7212cf9691a2885"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO shallow copy axes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/ops.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96aa7cfb6fdef3f8b5ddeb71ca04c9726b6c62245eb2a98bae4d16e4335b25f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): with 2D EAs only this first clause would be needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/internals/ops.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb7e8aa9156b35536bcef43e155377b8533b5fc3eec69d7430cbb413ad87f62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: chunks are implemented now, probably this should return something \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/interchange/column.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"35901054fb0b43f0ff4d9d349aeee8a86b84d43cef3ab9de662c244493d2d38a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this will need correcting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/interchange/column.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4af9e860e991a00fb163dd5d5bcec0ce9536f0159899e72d7d3beb235604d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe store as bit array to save space?.. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/interchange/column.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92a0de9738e46007d992137c3b2d71f352cad426ea2e55c26babefec552aa88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement for other bit/byte masks? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/interchange/column.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"18356006eedb877eadc318e0171d5cefcc3043813c806ba7b21b480a0287b344"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: not happy with Optional, but need to flag it may be 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":"pandas/core/interchange/dataframe_protocol.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f8b6a85d325caf4c6fd4667f844b82359856b107823ee3982b6cc26e1ade67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: No DLPack yet, so need to construct a new ndarray from the data pointer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/interchange/from_dataframe.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f19394c205b40ac6e760a659075ca0325d064908a6bd3dec70ad5fd047a597f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(infer_string) this should be LARGE_STRING for pyarrow storage, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/interchange/utils.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7187244093c3fc1e8ebe410bc87ae37b1769a6ac7a8e76b49fad44a4084ac729"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle index names! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/api.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eddc15c52ede4a8596f6c12533414cf69b5c31362041bc46c4b9b79675155e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this behavior is not tested (so may not be desired), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/api.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d105f9fd040e905bcf036287f34c0e894f9c645b1e20481da634eaef480e15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: what about Categorical[dt64]? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/api.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff1b0f23728a297e663a02a257da1ff3d9ac440b0d7a6fa6b50faeda4f2c841"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why do we need different justify for these cases? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a14cd71d7d054eb9ee00d4715a7d2304505a03bef4afcc4000db7bb16d242f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ExtensionIndex): 3rd party EA might override? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"26186f2987e1e9facc5a42fc417ba66dd498ce241033ed55ce9fda2bc7cf377e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: algos.unique1d should preserve DTA/TDA \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5d7f9fa9ca689386905905463717b49fbc13a3b9d090ca8c4b0ee2da35b4ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#50617): once Series.__[gs]etitem__ is removed we should be able"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":4288}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a6f5addfcd2300c07649c8feaf4d7682e190e84c9ff0f0e14fea761500faf7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: tests where passing \u0060keep_order=not self._is_multi\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":"pandas/core/indexes/base.py"},"region":{"startLine":4436}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a5e7a0e22b7ebe1e4d804f4fab475adf6fa89aa6c043e6a02deee4dd4cc237"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ExtensionIndex): remove special-case, just use self._values \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":5449}}}],"partialFingerprints":{"codehealthFindingId/v1":"c392f8763408405a6783f7ab906a8b1dfcd556fe2418a1a2145b768d1ee648d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(infer_string) can we avoid this special case? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":5952}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb2b42c7f32f78e9371d837086645844607832cc8f3de3d0b87d2bc2f686a06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: will be fixed when ExtensionArray.searchsorted() is 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":"pandas/core/indexes/base.py"},"region":{"startLine":6154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba98865c3123e8452f669382334cce686c88691113b1ba8022852b636f925f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if object, could use infer_dtype to preempt costly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":6463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26c295eddd43a4106386f01d0c5e7a90a0573dcb4108315ee437e3a3a6a22a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: get_indexer has fastpaths for both Categorical-self 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":"pandas/core/indexes/base.py"},"region":{"startLine":6471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2072968e3da60323a3a0da703a299ef0fa555c5fa86bc4c14b1987fa3f1718b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we dont have tests that get 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":"pandas/core/indexes/base.py"},"region":{"startLine":6722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aff623a4163ecff6f0caf111beebcce0ac1299f36a859acd673d9d2e8a7d475"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: may need itemsize check if we have non-64-bit Indexes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":6729}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1eefbbdc28c50a55646f7e3512d696b41f8c30b323d5d75e7f24ac039c2cd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this was written assuming we only get here with object-dtype, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":6830}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd99b720dfd229ff4028d86a54d8b600017942f746b4e2088949674a29d2aa7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if we are a MultiIndex, we can 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":"pandas/core/indexes/base.py"},"region":{"startLine":6849}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b41fd56e1515e2f8f529fd6c75f1211af1e9f35d07f4dbd1eb85c534c7c91f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: De-duplicate with map, xref GH#32349"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":6994}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd331a8cf71501404af737b4b04fab8081f155ceb175bd6d27d63f8ea52f14c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: better place to do this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":7182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf86eaa5dc8065557ef67db088162d680097dc45e4a218c5cb7df6f10f34a8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(__array_function__): special casing will be unnecessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":7544}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd471ade772e50cc022f348e36970f1cfd16b5526b4ebe55ff56bf9323d42cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should set MultiIndex._can_hold_na = False? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":7816}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ea0b0992a7c888b4fb7428eef4b4f02150a116722403d1932b7a47e9a9f098"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Apply maybe_sequence_to_range to sequences? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/base.py"},"region":{"startLine":8434}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdf6c06ec6174cb42373e5f305dc57b65fae67e718aabb36309c49cb2ec9aef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do this at the EA level? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc188162b64f1667b3b6c691253df4dda8323582a11595652cafdcf2442a353"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: not reached in tests 2023-10-11 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cc7df8bd2098a817bc16bf8eef16786c5f28091f503f2c79be3869319c3c21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: com.asarray_tuplesafe shouldn\u0027t cast e.g. DatetimeArray \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cb3e5386d4b6e387c1e20f6e89ee7748bd00ab8b74b38748806c8b95d3fb60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#41493): we cannot just do"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a37b25dc32aa8fc981bad352bbf2d28589ce68c1ced2db08a2649f7ca89263b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do union on the reversed indexes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimelike.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6880f12e053242d76b722d2ecad7993916c29f5de0884d6589868cc6ac3ca525"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: If we knew what was going in to **d, we might be able to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimes.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b534f03b869ffa95f696f7ccd1645a7d4a2bac03bd5eb4b85d82ca8abc57e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Also for fixed-offsets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/datetimes.py"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"258da85b9b4eabf5c1684bd221f3c18bccc65215e54fdb4822b53a8d550933c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider deprecating these in favor of \u0060union\u0060 (xref gh-15506) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/frozen.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c140c1cacecebe5051461604b612f5d420f73cce204136dd737a57b8dfceb653"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: DO this in maybe_booleans_to_slice? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/interval.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ce1c2e260d1a513bc8e2e9b323abf20eda1139a427f0643c2d037afc9a5cc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: arithmetic operations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/interval.py"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d61e7bccb5804cfc7b0950b25143d0d68ed7263f987e6fb50b66eac4e78965"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: need is_valid_na_for_dtype(key, level_index.dtype) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":3655}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e12c34c33045fa96f301dee565965a80cb962738beb222c38b3b97cfa51195b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: what if we have an IntervalIndex level? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f1573212186a4e4b517d3370f1b204c635ace9413e3bd15e9ec5dc5522aa36"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: we should be only dropping levels on which we 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":"pandas/core/indexes/multi.py"},"region":{"startLine":3907}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a3199718c1f8c09ec627a27282a3c109458e0e0fe692ea54d523e713ef957d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in some cases we still need to drop some levels, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":3967}}}],"partialFingerprints":{"codehealthFindingId/v1":"83be1f151362d67d476d36804bd24ce4e0f5854a35d2cd26d3ea72bda51e6cd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":3988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a908d2d2409fb9769811109c31848286cdcb5f3d9ce93d7d5ba2abbd176619"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: this message can be inaccurate, e.g. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":4016}}}],"partialFingerprints":{"codehealthFindingId/v1":"6910db61ede344f151957045f843d8985b82a07cd4eead2abb43394332fe597b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: what if they both have np.nan for their names? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/indexes/multi.py"},"region":{"startLine":4777}}}],"partialFingerprints":{"codehealthFindingId/v1":"058831226e4420ad5022353073ed4e8994944da931bf556b9675b07993ec1cf9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if other is a RangeIndex we may have more efficient 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":"pandas/core/indexes/range.py"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c13adf2eb9b4549cc0eb7c23a94733523838e98ed7a6bd820b58d02b6257b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(typing) the return value on this callable should be any *scalar*. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/generic.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb073810d2cb0353729f89d8794256feb69add088ff45e630bca2b0caa4362d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: validate types on ScalarResult and move to _typing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/generic.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f4c3237f7af8950207306a83e92995e7fb1e896df137f5a6ce976f102ef1d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: sure this is right?  we used to do this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/generic.py"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed8deb3f52fa5c9f59c2e05a7fe95a937b8b013d0ddeb24e6913fb21dae366"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Better repr for GroupBy object \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/groupby.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9434de67585874631fc210f4c41d29d3b45323c16219d97497a43a2f092978a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Is this exactly right; see WrappedCythonOp get_result_dtype? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/groupby.py"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c833647b1c0edcc2c261b22def91d85b505c2f0f90a50edbfe3eb968b3c3bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: shouldn\u0027t min_count matter? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/groupby.py"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e9e50e12306fc186f1f94c25fe6962039dc01f99a0190fa307af925134ea68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(EA2D): reshape would not be necessary with 2D EAs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/groupby.py"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9fd0933e18f35ddcb3e41a0756b1671f4ba3f5ccece89449023dcf699976b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: For DataFrames what if columns are mixed arrow/numpy/masked? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/groupby.py"},"region":{"startLine":2798}}}],"partialFingerprints":{"codehealthFindingId/v1":"394b275d491fbf7423f4d97d16dceffbf84bb098a2dc5d3bed23623715c6a942"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Better way to find # of observed groups? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/groupby.py"},"region":{"startLine":5839}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cffa6bfdcc163683361b0d1d6fac022f401543cca9b8ff5145322226759c3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: What are we assuming about subsequent calls? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/grouper.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0693ca3c5a48b3e275c78d21a054db7eb56ca4fa1234f6e04cb3b5999e6a29d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: why does putting na_position=\u0022first\u0022 fix datetimelike cases? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/grouper.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0577d3f71a12709e69b9b2197762f4b5e748b8f2570a05400defc88b4ceb56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we unwrap this and get a tighter typing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/grouper.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87d6688ad3d3ab5f44f6baf866593353bce33b145b0a43bcdda28297aec4309"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: 2023-02-03 no test cases with len(newgrouper.groupings) \u003E 1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/grouper.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1507230bcb0a5b5a5a25f7fd4a62fad49aa17d39055e8215a6eb81845d60a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO 2022-10-08 we only have one test that gets here 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":"pandas/core/groupby/grouper.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67911b627bc045b39749cd82c00c0fe4d15e877b0e95f3e18bba40bac03276f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: These if-block and else-block are almost same. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/grouper.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32e8b5259111701479d37b1757a285c10f9c1192b93d4502aa2fb896cb66ef5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: min_count \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/ops.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98d32ccfe813c49a56c43c640861f48ddaebf20688b76a122982f087ef82427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should rank take result_mask? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/ops.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"135db25f17934f10daeea4d2064cfb234584ada5cde509dfa781976b0dc7a670"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Would be more efficient to skip unobserved for transforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/groupby/ops.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"971421a591931fb2d0ac80fe611a30b53c5c7fbab0b3848b751b794f2958bc4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use tolerance like we do for float? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"581e40ba222137285b7265394b78588c65ab6fdf1bb69eb0d83db29a4059311e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#45349): don\u0027t special-case IntervalDtype, allow"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"26215dc6aa277b51c3c96c7d4c83a240f87839f95f0afc2c8882f089413f87ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test with datetime(2920, 10, 1) based on test_replace_dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dafd2b8c93a72130232fcc933534de2287b90964e98ef8d1a3fdc8682d52a15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: _from_sequence would raise ValueError in cases where \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d14f11ebe5901f8098aa51c3139732822346692008435f272d3c273de89d0ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: ValueError or TypeError? existing test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc648cb8c1b642c9e71f41291d5ba1b5d3121d4840a00f7cff7509c414a1a06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: other value-dependent functions to standardize here include \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01319e08049a6c05decffcd4be8576710f5b2ecfaec3d3c4bd5f6e44f45df40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we need to recreate numpy\u0027s inspection logic for floats too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f768990b5ad1ac24378eb4eb8cea6517ea624d218aea48825348fd968f4c3158"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: more generally, could do \u0060not can_hold_na(dtype)\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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a880e749485a8b8ea7049cff592a51583217540af34f0770e47969156b2ceceb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(numpy-2.0 min): This case will raise an OverflowError above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c421821d2dadabdb0681e1926957d1e4ca4433366a5285e165486f87916dc814"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can this be hit anymore after numpy 2.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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3e64f02192673b3828c39a15b9f478a493c15a474b6a6c11dcc13c00e614c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Can this path be hit anymore with numpy \u003E 2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae31a14f5c95f85474bb36234b28a990bc32375238cbe18c3ff642f22bbb3f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: general-case for EAs? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"018fb6ffef4dbc0d96741155216010df86500e88703b5c065d8b9de73fc86982"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: faster to check (element \u003E=0).all()?  potential \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd782452a78ba8b06a83e011a76d0e234d0b10f14f8a484b2443bfdfec2e54a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: itemsize check? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f5e866562b08e412ad730f5194c44b8f3d3be529ee3d9ff2c9514c145bec52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test tests.frame.methods.test_replace tests get 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":"pandas/core/dtypes/cast.py"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf876fe6e9a3f03a09fcbb72433732ffdfc557e8ae1a858ca32bbd9ccab2e79c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: warnings.catch_warnings can be removed when numpy\u003E2.3.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":"pandas/core/dtypes/common.py"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"244821dc50aa8e954756b70da0dd84dc6cf949cf8b4ee84a7155de05e15394a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Document public vs. private API \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"44de80780517f27589082b82a18492d9506d5536a3fb9132483001d6a6457b4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: hash_array doesn\u0027t handle mixed types. It casts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"671a560e87c685dd46587249c4422d9b28d18eeed2b26d3bdec513ae9df20e20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO we should figure out the expected return value in general \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"e602f1d45dbd3363cdb21eeb78dfdf8ea59ba964a748d4194e091c561286b703"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO should categorical always give an answer? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c9692b5db2f7542f99ed4093113edfef23552506e76762af5a44109c300ff5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"f662344ebfb72c8a0370f2abd714671c05b8b81063f39dc1c99778f178aa07d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(3.0): enforcing this will close GH#10575"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbaa357b7432b358737d0f1d577d620919fe4e6d5c109c87caf8ecf4e748bc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO for now only handle SparseDtypes and numpy dtypes =\u003E extend \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"318b32768cf06b90f14d503c13155e947363ea049c681ffecb64b984ff8ee6ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Potentially change this \u0026 CategoricalDtype.type to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c536a54968f92e3268e89f382f404683a6fc08f29e80f3deb6d0e6931c91158b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: None? pd.NA? pa.null? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"308f2c044c824af9b3bc3eb2cf3d619886a8c5b2618b3d98f4e3e692bea5b94d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(arrow#33642): This can be removed once supported by pyarrow"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2162b2305a53bba931c9f96ea19fdb21327d13e9025970bc772051593da02868"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: pa.types.is_boolean? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/dtypes.py"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4f5cbd7cadd110cb0ee6607ac12fa3a29ec3281d50c297a1bbdc68dc1614f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: fastpath for pandas\u0027 StringDtype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/missing.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"266ffe5e5df53263ade100a675cebc0a72d37110c1419e124b73b9cf92242beb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: validate this in a more general way (thinking of future engines \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/computation/eval.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab5e95bdab8c4b1a9bea5f8feb98eca34c596e7b3f6dc7e69c744f9f4282074"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(py314): deprecated since Python 3.8. Remove after Python 3.14 is min \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/computation/expr.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38ca4a4390f1fbbd71f4be963c96d72d3f73e39a226ebc05871a91ffb92a7e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(py314): deprecated since Python 3.8. Remove after Python 3.14 is min \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/computation/expr.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"177422b28866a89ab83059aa955748019a13efbc17b91922697165b9a884c007"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(py314): deprecated since Python 3.8. Remove after Python 3.14 is min \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/computation/expr.py"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"0048eda278bb0c3219a388b22a1951b7c095e43fddc9239be3f0488794352e9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: return None might never be reached \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/computation/pytables.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"946d9c12fd7ae9fded9725333e7ac3e52f3b0e6863332836c34d54fac6dfd1b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: disable for Categorical if not ordered? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/_mixins.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"379cf5c41ab9a985f23edf3beba907a27b54ea98bd72b6c115713aa3275156c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: technically __init__ isn\u0027t defined 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":"pandas/core/arrays/_mixins.py"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"f662a55f96b919b40b807d87e6d675687765e23c946f52a09640d00f821a8707"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: GH#15362"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/categorical.py"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"36071a401147c413b3467969331f3b095315559836486429be1341c24f4d0fde"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove Datetime \u0026 DatetimeTZ formatters. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"42435abeece5d3f55bf0db95f05df8bd562b8806f711a006b8a9225630f46f00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: try to de-duplicate these, ensure identical behavior \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9257aba90a93f96293775a80354121ec8f1e59c60dc04b7af7d3c9ec6b5b39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Could use from_sequence_of_strings if implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd399af766db965b75fc07aad2e4bad64312bef12102161187ad913cb12f9988"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we need equal dtype or just comparable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c7a20de7ffe882129e8a3ce8877a02c7ac44c8c2416e24591269007ac78c0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: de-duplicate with equals, validate_comparison_value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9df9c368d10ce6861f3cad97a489209ea8bf1f0c36cfcb7343d654a23f436c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Deprecate this case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f755ad46daddb02bf0bc7f0050764fe8ad3aad5c6d0af0e17e04f7298a6d8452"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle 2D-like listlikes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cbdf3e10cac079d198b0ef0ea4e1233d88be19e324c14466a49e02c6a4b51a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Can we simplify/generalize these cases at all? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9d3033496fb193e09613c063f0f0b4befcf8c1223a351fc153c8b1e1dba53e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: annotate other as DatetimeArray | TimedeltaArray | Timestamp | Timedelta \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6b8694821c06cbd07bc89131fa605a03b61685cf4ad1aab7a16cd2c1f42cbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we reuse is_date_array_normalized?  would need a skipna kwd \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":2458}}}],"partialFingerprints":{"codehealthFindingId/v1":"725a84da5e4ac46bcbb603747bc9f09e8a91931796370753c3a96caf169cf5a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: cases where we need to do another pass through maybe_convert_dtype, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"958093812f60d6f91dbae913093ae109d222a38ee09cf1e8903564b7594cb86f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: preserve freq? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimes.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb65450af77909d85b65380e05356bc392b04fd4e0f6a2bd205186ea86dd7634"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: We do not have tests specific to string-dtypes, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimes.py"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"95acd3ac32632e4cba1cd47caf88386583d513ba2b1388c0dbc4c22b9c012632"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: better way to handle this?  non-copying alternative? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/datetimes.py"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4efbc9a0f32aa5d1539d80a6e354109324bbab407918693cc7c1c1b473d3fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if tz is UTC, are there situations where we *don\u0027t* want 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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":2809}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3c641c6208278507e148b1302c523c8bdb3d32031732cf73c1d7edd51b2ed0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: We have no tests for 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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d184b0ee7596da73aa1de1f4af663aa814421ed71a68f041724066d6e99e7be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: in an IntervalIndex we can reuse the cached \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/interval.py"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"519d7efb11c324d1853b33be7aef1b7ee549fe0a92a2eac98ccb4718991373ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: other cases we can use lexsort for?  much more performant. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/interval.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec7401331d3f38f41febd0c0cfba1ed98c50efa1122d3d93d8792d8f8da5f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should we just cast these to list? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/interval.py"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"34afa0ff3fcbb5d59b46b263c1d974632be8cada4b4fcb8affa885762f5e89ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: get this all from np_can_hold_element? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1374938259089c9c08b703fb17717f1d6502fa427343bb5b8b5aaf52148a012c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(4.0): range check belongs here once GH#48867 is enforced; raise"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa998858850463f5038f28337d12b9aa8d91c7d80c0391619d45a6e8940057c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: need to make sure we have the same order for data/mask \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a50a1b959fe5d35bda33b31c40c2baf75f5a8f7485e6ab0cf58c6b2c6e36c59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO deal with NaNs for FloatingArray case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b66f36802ad13ddab7be4dd09e4797612e51a0739a0373dce0524fac05fb39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Is rounding what we want long term? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84ecb150ed9109efca807096380117215770101a7c3ed997762c282aea529dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: need test for BooleanArray needing a copy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"0865f7c73299a5bdce429a6e9feb1575ecaeef353b73d8ce59efba46b46ff2f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#30188) ATM we don\u0027t match the behavior of non-masked"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb76e8d2e56c5a834127f5087624baeecc30cbd0571721da7b24ee8f7abc887"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jreback) what if we have a non-na float as a fill value? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"214dc2991d0d286a5752934df34d3b11e99b6d7b9a0ec66ed3ee44d94e202b80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(GH#40932): na_value_for_dtype(self.dtype.numpy_dtype)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/masked.py"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5ce2bcbda9e71a06b099860bc7303808b1c12e6949db692e7e26ea9ee91b85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: assert we have floating dtype? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/numpy_.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"455e86846cd8c8a0aea5cf7ae328a97ac36262ac2f3907b2024be58dfc5fc8ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: other cases? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/period.py"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3949ac4ece96b23756adfee7b17f3959da8c0bc1473081923ee65b01e6f6cb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we de-duplicate with Period._add_timedeltalike_scalar? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/period.py"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7053560db0bf8fecf664bd338fc8560188894932f8af46c59060bd416529a106"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO should dtype == \u0022string\u0022 work for the NaN variant? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/string_.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a892ce68f10c116f89e5b1bf63c38cda7e7e525570075b02913d105578ee98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(4.0): Once the deprecation here is enforced, this method can be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/string_.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9293c3338b305d314e5d07dd4369a007a5bc80cebae3b7bbf8794470d719175"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: shouldn\u0027t this already be caught my passed mask? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/string_.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca4a4c5fb776db13e60c3b4624c196c4d688d1f4dae83319386e815e8c2b5c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we could alternatively do this check before map_infer_mask \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/string_.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"4333f655cccad87c105417980f2d43f9ea4c42ddcc01a5727d8e45c9bf9203f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO validate or force NA/None to NaN \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/string_.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc09e3c1155da02741a77f795d732ddf543b87fdc388ab991ee23ddd5b608382"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Inherit directly from BaseStringArrayMethods. Currently we inherit 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":"pandas/core/arrays/string_arrow.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d9577a9d74dded81a2c88d0925f7224a872506a01c6410731f75a285a9b572"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(numpy\u003E=2.5): numpy detects this natively (numpy GH-31378)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/timedeltas.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"69acab015b04617ac28aeb16c9434633d83bbca1bc65d0eff795b247d7b10419"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make kind=None, and use data.kind? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"07adfa248d04e18e96183816b91982d01b3d1435b9fcedd4c319ab8f1e73c2b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: disentangle the fill_value dtype inference 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":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"086fd68c500bd964308635f7c2e127159419e1079f151db0e5c589f68912af63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: What should the empty dtype be? Object or float? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d997589bc1d6de0c87aa0a3aef4b8a17e34de912b26996528ceeb79ba3d8e5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: avoid double copy when dtype forces cast. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"629fdfc1ee46f071c98f36b041f741d00d0e94f2cdcfd25659f533abdd0e9898"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: wraparound \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fd22ffe87eec9f5207a013af3ecac2fbc06b257549fa6e2ee237dd591ec2cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make this more flexible than just ndarray... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":3011}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a16b29289ac98a92fcb87f79492840ea769fb9f6cde369d9d657718ae31d4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: copy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/sparse/array.py"},"region":{"startLine":3218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b2e15edd48c90674bacb414132ec0b48e5eec9612cc185bac1ef491f5c5e33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support negative start/stop/step, ideally this would be 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":"pandas/core/arrays/arrow/accessors.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a408edcf32a405d105bd18cf8908393c2d09aff941117f8a1c0ba3e7c8969b94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: When adding negative step support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/accessors.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8bb8928c5b6a69b3bdb0210acf529bc5fa4b82a6a9abadadd14ca182446553"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Replace with pyarrow floordiv kernel. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd26412dc8f5280dc72119fe23895703a9cce2fae9478748e640abe6ac528c65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Move logic in _from_sequence_of_strings into \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c6260049f84788cecf6d9517e0aedd70d2b15737bc96bce32d408f0053bb14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(infer_string) should this be large_string? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f389e67441a67134599883b1695ccdfd0e9ccb21082bcb5a406531ae7b701e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should be handled by pyarrow? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddc1bffe4d04b30e67083d020aedbf594282d993527279c07a86445c8025049"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: By using \u0060zero_copy_only\u0060 it may be possible to implement this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f98365c06eafc6930e5f4f27440a8c9416dc2162590cceaebde8f377ac1573d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #  TODO: is this documented somewhere? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"51972396c0ec60d034ce8da9b9932821caa6f42203db51eb88c5f47dbafc8cbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe complex? object? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6a6d770b329cf69317bf0d410252260d0c9fbd272ac4020ce9d30c0f771a6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove try/except wrapper if/when pyarrow implements \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"a033421093561fe24975f128b96de225fb3b7461e5056cc82923086834539b67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove try/except wrapper if/when pyarrow implements \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd1f4e009a0b2fa33939ba7a94d23f5eba28993107dccb886bbb544abd1a327"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ARROW-9433): Treat negative indices as NULL"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd296e1c5ef8036b6652d17c54bb168ba870fa94afc245017e9cd60aa113eaf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: ArrowNotImplementedError: Function fill_null has 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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6713d08bfa37a779f2251580da40e2d51f87abe2342b0c16d055c23cf27dc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ARROW-9432): Treat negative indices as indices from the right."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2ee6102c1bb078c7448eb9973076cb942bb2440672024c9c7096d04357a5f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this part when pa.if_else is fixed (GH#64320)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29f85c571475d1371174a5790b5a7e58e8c29eb74c18c94118feaa14fde8ba9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this prob needs some better checking for 2D cases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/array_algos/putmask.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c84a4d3101be43d1f8e5c6c8c3aab8e4cbe71149a8dc3fd8302ad455beb9a1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should use missing.mask_missing? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/array_algos/replace.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d91b670039e6d18da39a49d8340acdcde0679a372fc15151b83c7e699e7774"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Preserve complex dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/_numba/executor.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c7cf8c8bcd231bba48060b87edd3b1efe5b3563cf651fdd9ccdda1a9e150b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Optimize this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/_numba/executor.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"153bfb4c8945916874de7560a0f58eecaf3370faf05fdd4f026f01984107f539"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Range index support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/_numba/extensions.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1f848cb12015737990068b0ce6f2db80c523535dd4b4b0cd50b6b8d9eb2604"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: preserve the original class for the index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/_numba/extensions.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"204533d12ae61166a611d7f7bc25fa24ae0d9774ff6aa2dcbc1ec099d51724ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Check index matching? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/_numba/extensions.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5a590dd48fae85aa4ba18f24ed2981488b653c5063202c04b391e01c90f5c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Can\u0027t import Styler without importing jinja2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/api/typing/__init__.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d516e374f2066e928dc129e063fd701329066e600afa5a5c3989f906f6569"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add container like pyarrow types: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/_testing/__init__.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce90774a805fa952fc084e550729ec708e84b8053e23159a6312fbedaba196a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: GH#33198 the setting here shouldn\u0027t need two steps"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"asv_bench/benchmarks/arithmetic.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29d607379fb1cec73770d8d229bac75162222195b94bfe1ba5bdfcebacc2cd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: share with something in pd._testing? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"asv_bench/benchmarks/libs.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b20f9206dc50e8620e6a6cc589340ddaaaeb9e1b54a638dc141b97035ea640"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: cases with different levels of short-circuiting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"asv_bench/benchmarks/tslibs/normalize.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc74c6fd7e5028c9107a38fd50e15b1204cc079eed2edeac8e7c0048eb447068"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: fold? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"asv_bench/benchmarks/tslibs/tslib.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b2fb41137b76d48d561d8c15b1775e19e73a1c1c1462ebe62ad79638e8619d"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060ReadCsvBuffer\u0060 spells \u0060Csv\u0060 where 27 names in the project spell it \u0060CSV\u0060: 27 of 28 names in project pandas spell the token \u0060CSV\u0060 (27 of 28; unit: names in project pandas containing \u0060CSV\u0060). Peers: asv_bench.benchmarks.gil.ParallelReadCSV (asv_bench/benchmarks/gil.py:264); asv_bench.benchmarks.io.csv.ToCSV (asv_bench/benchmarks/io/csv.py:24); asv_bench.benchmarks.io.csv.ToCSVFloatFormatVariants (asv_bench/benchmarks/io/csv.py:56); asv_bench.benchmarks.io.csv.ToCSVMultiIndexUnusedLevels (asv_bench/benchmarks/io/csv.py:75); asv_bench.benchmarks.io.csv.ToCSVDatetime (asv_bench/benchmarks/io/csv.py:94). Rename to \u0060ReadCSVBuffer\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/_typing.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f25241510e53bb0880287cec6141b78d5a2a022b3fe93011d49b90d5db5147"}},{"ruleId":"D28","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":"7199a7c49829bd816fd151b4c05e20490ca0cdb988526eda8e6adbd391f4c208"},"properties":{"commitSha":"56caedb69954ddbac05ff81180158bc06f8b41db"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"c69884f2d9cfc92047bbd1c17c1b0c130a87cc39a77578f999bf650940b01cb4"},"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":"e755ac5382151b3a679ccdf838c90742f41ef5ad7ae26165a641b232cf15a88a"},"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":"00c2d9cd414172ed9c39c8110af142f2f605e572d6219e873dbc4035125563f3"},"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":"015d1911a3d67db5fe0f41c24328745a4af0ec8f40f00d544448a4a54d694b30"},"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":"265173d94d77ab3a289a8cc8f594f82065904cf1ec1f2b9a32e9130538960336"},"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":"f013b346c4d0ced5274170403f51f1b2e4d222874398879cc4bfba8ec57266c0"},"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":"a1acca35113cc1c6a3d097449decdb1ff832915ab7918295372a68ba9c60c39e"},"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":"d68ed80532aebb6fff85b64c7bb61c1365213321493d29edb7a8a003f63c69f8"},"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":"6019c386a98e0778db6a978d712c78a1daa9e2a222c26dfd09838682117b1d60"},"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":"c3449c6266dcde6e8b7c47a290f28b073ed60d000c8d3596e11a91514b306066"},"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":"749133b33efcf2e164aea10ba74765992127e418bcdfe45783518c3dce4b39aa"},"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":"0acedb8dab4c209b1f80c5d42e4b78a1e6948014e03a8f3156f074f173c87c8e"},"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":"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":"940f38244c0108a36180c4499c135606356c6fabd8010f508131f732ba220b28"},"taxa":[{"id":"CWE-116","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":"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":"349c0650f01adf535b438fefe54c274090c98f5f858da688319c91684ead7828"},"taxa":[{"id":"CWE-116","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":"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":"198190634a8ed7ef30ea03e33bdd13e7523cf9365b85692f9bed4105c47bed5b"},"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":"0145fccdefccce53ae41ba2232325179cae7976edf239520688c390b2a5714e4"},"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":"82e7ba1f9cdae56011feb57ab5af84b96da81e33caacfe2eeb7085166deb6320"},"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":"4c75b1199fdccef1a607d544c7ca2a20ac2aade93ed3179042f2e45bfca9939d"},"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":"633621607fe473498d3eadf7a0d4fb1a09ca11674f4b94e44c212ee1c264e7a9"},"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":"cdb136ae7693d2d4836c5d362d9d06660a7635bdb41f7a305bbd04f62963427b"},"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":"300edae9f22af63b5df21b1a0c9a0f128802e9e8e40bfc4ed4918c3a2c589fd9"},"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":"a8c8de7b3523a15b7c49956ee5f4d938d667738d129a8b70d429db9a461e81b6"},"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":"67c0f0b1375a941887fb23580322c10f7a40ec856fd71ee51ad4432b0b632de1"},"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":"e3d761dda02361246d9e0046291b487d72038984bde8947e2c84a0b559e47c55"},"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":"294d6b25cea214ee028392eb195b68765fdcab736163e51bb71f5d4d5fff3039"},"taxa":[{"id":"CWE-79","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":"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":"2706b1f93c3a216ac22166b30e2f7b17332a7a223311e5981dca15a75a422902"},"taxa":[{"id":"CWE-79","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":"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":"c7097f9438c89521ab823116a922e10d090876be2ce5dbb4e29d1d2e80d822f9"},"taxa":[{"id":"CWE-79","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":"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":"61d17850524780f82af2f95b2c7f6b40cbbad99dd7c8500d621accc9967f6fb8"},"taxa":[{"id":"CWE-79","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":"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":"b3d806480849584fbdff1ab86c56c0eca08dcee719b19d884f2759d10ecb871c"},"taxa":[{"id":"CWE-79","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":"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":"26f18f9eb61cf8843a92986049a954bfd2b353dd22c5f663d97246d66a863163"},"taxa":[{"id":"CWE-79","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":"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":"285ccea541581ca173d30ddd43d0bea24f05ef4bc16ed119ef8c4184f3c93834"},"taxa":[{"id":"CWE-116","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":"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":"2f2958cccb218701e1b45d785f5d008aee70ffa656b769679e1b7b37f4b0ee9f"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3de762961bd85ed761e9203da76d5a8b11bf4fff10fd410db815c928fc58f53c"},"properties":{"dependency":{"package":"nbconvert","version":"7.11.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 19 of 286 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 286 of the 386 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: pandas/core/_numba/extensions.py, pandas/core/interchange/dataframe_protocol.py, asv_bench/benchmarks/strings.py, asv_bench/benchmarks/sparse.py, pandas/core/arrays/sparse/scipy_sparse.py, pandas/core/ops/mask_ops.py, scripts/check_test_naming.py, asv_bench/benchmarks/plotting.py (and 11 more). 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":"pandas/core/_numba/extensions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"634375a257022c82b6b975bf2d507ab0df54f0c623ad5d7b49f6721442d31989"}},{"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":"pandas/core/interchange/dataframe_protocol.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b190123fcd79e9945ab07efb38fbfbc43ed8b68982d125405a63c5acc566a6a"}},{"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":"asv_bench/benchmarks/strings.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d043056ea974af046f1263fa45d713adfed8ef79d76bd2d3278c3acc398c132d"}},{"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":"asv_bench/benchmarks/sparse.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a071a7d795eb8fcdbbe66e3d99b2263ba78a3d89f474390434db310a210aea4"}},{"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":"pandas/core/arrays/sparse/scipy_sparse.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee48681baa78a6bd2e797937ccd79cc3fcce2d24491036b337114362733f748c"}},{"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":"pandas/core/ops/mask_ops.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd85afcf80ef88025877b911af1b2dbe8a6775c0de9a7d618b7830bd735751d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_test_naming.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75e80ce8225855c1dc99a679f4029db8416f2b6abfef19eeb3a459e4a033aa0"}},{"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":"asv_bench/benchmarks/plotting.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"166e06f3b6dbefb97d2a02182f545a04a0dd092c07fe51615287f71e5f0edbc9"}},{"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":"pandas/plotting/_matplotlib/groupby.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6b2b5dac346fee895ef920d8d762c289297fca2a294047f0ce3a6a95d01fc0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_for_inconsistent_pandas_namespace.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db90d4344bb3735f07420daa4d7fed0929926a705e1e1390ba06ed11cdf4dba"}},{"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":"asv_bench/benchmarks/array.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa05aa43f3ff9c20f67d1289b61475a411110e012bf77fd65ac1a5a5c485f02f"}},{"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":"pandas/core/interchange/dataframe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd383fbfaf3594b40b365e764939d5ca10cdaee5a4a2320ab1b4cedbe6f41115"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate_exception_location.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"620159328e9aea22ef5b3dad4854fe33ec6bed5396d0794b0f697e6293d51002"}},{"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":"pandas/core/interchange/buffer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddfbab509857fd961db89b6834a0bebdeeb2ae8a7bd63b4f978fc43045fea3c"}},{"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":"asv_bench/benchmarks/io/style.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ba847d8297317a184f06eefece2fedafad9012d40c4d6f6a42ac484e15309a"}},{"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":"pandas/core/array_algos/masked_accumulations.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92aeebf82f8591ab585ec2350b3753707016ae38b0ee3b0f355d8adb6d2d8b2c"}},{"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":"pandas/api/typing/aliases.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d196d9d232c3bd238ff10572d39cb6ad8dcc58f4b2fa93501e6e373c57f7ddcc"}},{"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":"asv_bench/benchmarks/io/excel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb167ca4892fd694c27afa1d9ea824ad1d379bc3db5bbf4802d7b3d8d846533f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sort_whatsnew_note.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"239424b13c6af6b3e1b4398ac8f7464cc1550c81fc479c7a802c01e136108a41"}},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"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":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/_templates/layout.html"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"798eb840ee238d82ae27266ff9cb3c2b77b9e2b4de9c17cca081dd75434df704"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/_templates/layout.html"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdfd8d906f702e5af16817c79407a97e1379e65ddf5436ed5c6fe2e9e2361c4"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/_templates/layout.html"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc03b4b0aac8be07d6b5e05cbcc04ed877d44ad36dec6482b718dc2d5c76f810"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/_templates/layout.html"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4fce452cd39cffd2935cb88feabb543c6f217601897ad9dda46b0382100b31"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/_templates/layout.html"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd36bf5f5b79af5ff711a417fac158e9a66e1bff6036453fcb653a247a87e18"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/index.html"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db39c7289c7d1ece64e87cdbf1bf3d8819c68da506aaa532dbe022854049ac3"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/index.html"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f3e30cadd31126ba7a72a7f7dc5ccfc31da08d44ee712381f0886aded4cb25"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/index.html"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e564666d82347b620ef75cf8ebc0f2aaca5ad11ae1aa044f67bf96268e32ce"}},{"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":"pandas/io/formats/templates/html.tpl"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab274cfeda48b683d66ab804b2a1cdc6b77b9f7c719f2d7f05584b5e8e07ca4"}},{"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":"pandas/io/formats/templates/html.tpl"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ba89807af0915669be20505fb503810ae1baa0111cfae8a3c8931ae1638aa4"}},{"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":"web/pandas/_templates/layout.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6821c1cd640c22243f4e0e5aaa0a933c1a54c8746015134c110e53e1e24a829"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/index.html"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6e0e720105eafe87fd20cd7d9d4b6d714c92a6e56b8969ae4cbae12e507f71"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.2:1): \u0060blockquote\u0060 sets color: #787878 on background-color: #f9f9f9 \u2014 4.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/static/css/pandas.css"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"782151985ebdfcba49611c19cc223f5e519ba18b4af4972539a040a42a8d9894"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.gs-data .badge\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/source/_static/css/getting_started.css"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"15531b628178aa68dbde5facb2356aaacde34407a7c3d4a74571e1f89c59cbef"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Most of the production code is in directories of its own, but 2 application file(s) sit at the repository root beside the build and tooling files (\u0060generate_pxi.py\u0060, \u0060generate_version.py\u0060)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch pip: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060pip\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf68ee1ea2969cbbdae4336ca738b5320c565628ea6ee894219d523831dd0f17"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://views.scientific-python.org/js/script.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pandas/_templates/layout.html"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb74945ddfa16f8d44c9aed9d0b9791cdc04e3af13bb2734ce6e1377bea63c0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.mergestart is not None and cell.mergeend is not None\u0060 appears character-identically in 3 files \u2014 pandas/io/excel/_odswriter.py, pandas/io/excel/_openpyxl.py, pandas/io/excel/_xlsxwriter.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":"pandas/io/excel/_odswriter.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"68295807eaae5e57932fd0507b0622cf21fff56ca6c8b90291d1f47cfd42cbf6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060converted_row and converted_row[-1] == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 pandas/io/excel/_openpyxl.py, pandas/io/excel/_pyxlsb.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":"pandas/io/excel/_openpyxl.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a5d6b14277f27eaabe087af4da80e2b076c454cef8417c4b6b5d314b74190b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype is None or astype_is_view(data.dtype, pandas_dtype(dtype))\u0060 appears character-identically in 2 files \u2014 pandas/core/indexes/base.py, pandas/core/series.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":"pandas/core/indexes/base.py"},"region":{"startLine":5606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e394dd85ced408cb4928781c648cec6a12a56b564143c71c67235ef23077bb72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype.kind == \u0022V\u0022 and not isinstance(dtype, ExtensionDtype)\u0060 appears character-identically in 2 files \u2014 pandas/core/generic.py, pandas/core/indexes/base.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/generic.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1d9332371f8f9cfa0a50784bba07c58223d549b39bc1fefefb661633a376b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file_rows_needed is not None and len(data) \u003E= file_rows_needed\u0060 appears character-identically in 2 files \u2014 pandas/io/excel/_openpyxl.py, pandas/io/excel/_pyxlsb.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":"pandas/io/excel/_openpyxl.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4a18ed492341523c5a5fc8756a43d9d67f446828f92664a4ec006d8c25d283"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060freq is None and com.any_none(periods, start, end)\u0060 appears character-identically in 3 files \u2014 pandas/core/indexes/datetimes.py, pandas/core/indexes/interval.py, pandas/core/indexes/timedeltas.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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfa613bd9d9989c2f6b698a22ab15d63cdd985faaa09443c3cf79f727af5f82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060freq is not None and fill_value is not lib.no_default\u0060 appears character-identically in 2 files \u2014 pandas/core/frame.py, pandas/core/generic.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":"pandas/core/frame.py"},"region":{"startLine":7632}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ce56742155c9ec2612031210c48e952eff332ec8988c9e8396b4b214553bbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(data, \u0022__arrow_c_array__\u0022) or hasattr(data, \u0022__arrow_c_stream__\u0022)\u0060 appears character-identically in 2 files \u2014 pandas/core/frame.py, pandas/core/series.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":"pandas/core/frame.py"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45656fa70eb6c957d0a5db174b6248590762c1f9bc35bc16d6f32e909e52a52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i == 0 or not is_monotonic_increasing_bounds\u0060 appears character-identically in 3 files \u2014 pandas/core/_numba/kernels/mean_.py, pandas/core/_numba/kernels/sum_.py, pandas/core/_numba/kernels/var_.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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2ebf54bf8a237271f6ea0fa9adad30581b72fd83d58a59cb40138126466c7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060indices.ndim == 1 and lib.is_range_indexer(indices, len(self))\u0060 appears character-identically in 2 files \u2014 pandas/core/indexes/base.py, pandas/core/indexes/multi.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":"pandas/core/indexes/base.py"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ef8918b1612b5434016b31b1f07b5cf80bb7421196c74c77fb56900603e5b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_float(periods) and periods.is_integer()\u0060 appears character-identically in 2 files \u2014 pandas/core/frame.py, pandas/core/series.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":"pandas/core/frame.py"},"region":{"startLine":14941}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b96fbe7b975c33017bde0f7b6c4bddadc80ff64d74b7c1c6d7e0b0503e18c33"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_list_like(other) and not isinstance(other, (list, np.ndarray, ExtensionArray)) and not ops.has_castable_attr(other)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/masked.py, pandas/core/arrays/sparse/array.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":"pandas/core/arrays/masked.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cdd03fb506b1ce486c9d4219e4b6abb20d7d8027404cb61c28d27d54c73f92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_monotonic_increasing( start ) and is_monotonic_increasing(end)\u0060 appears character-identically in 3 files \u2014 pandas/core/_numba/kernels/mean_.py, pandas/core/_numba/kernels/sum_.py, pandas/core/_numba/kernels/var_.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":"pandas/core/_numba/kernels/mean_.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5424fb813262051977dab50aa2944ffd52fee3c0d71e4301bef8406af54a59a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(col, int) and col not in self.orig_names\u0060 appears character-identically in 2 files \u2014 pandas/io/parsers/base_parser.py, pandas/io/parsers/python_parser.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":"pandas/io/parsers/base_parser.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a032cc1dd6e69139a66f41e8b084f796ddfa1cae9cd4c18f5b42ee8246b73b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(data, np.ndarray) and data.dtype.names is not None\u0060 appears character-identically in 2 files \u2014 pandas/core/construction.py, pandas/core/internals/construction.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":"pandas/core/construction.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff9c3edffe4d1c28c9cd55141a21573ce083d7a46af0833bb8529cdb2e0e291"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(dtype, CategoricalDtype) and dtype.categories is not None\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/categorical.py, pandas/core/ops/invalid.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":"pandas/core/arrays/categorical.py"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d8b169908a4e9f976dc4a1f69b156c35165e14478b43337b5b0784032e3e85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(dtype, str) and dtype == \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/string_.py, pandas/core/arrays/string_arrow.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":"pandas/core/arrays/string_.py"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"862b4693ed239358982a7c8cb5084598ed5c741d4ad2edd331c17c68a68d66ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(key, tuple) and len(key) == 1\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/arrow/array.py, pandas/core/indexing.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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"44216572886e36b0b28451da35bc0240ba4ecf26475d4d89b5fe0968a2253917"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(keys, list) and len(keys) == 1\u0060 appears character-identically in 2 files \u2014 pandas/core/groupby/groupby.py, pandas/plotting/_matplotlib/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":"pandas/core/groupby/groupby.py"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"195216e86293dd0f41e2ac46fc7e3bdffb93e87d95abfce10e6cf0e15de1886c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, np.ndarray) and isinstance(right, np.ndarray)\u0060 appears character-identically in 2 files \u2014 pandas/_testing/__init__.py, pandas/_testing/asserters.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":"pandas/_testing/__init__.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f653d8d1f32ac266b5c3617939903ad1845feb5003282ff8195df88b3bce04f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left.dtype, CategoricalDtype) and isinstance( right.dtype, CategoricalDtype )\u0060 appears character-identically in 2 files \u2014 pandas/_testing/asserters.py, pandas/core/reshape/merge.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":"pandas/_testing/asserters.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4db5666b830047d24e5b548a6c10ab7e476a9ff0dfec001f83f458458f6662"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(mask, np.ndarray) and mask.dtype == np.bool_\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/boolean.py, pandas/core/arrays/masked.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":"pandas/core/arrays/boolean.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a4aa97a193e3b4d142e501af4222bfceb552da936ad9bcabe35a6e09c5f118"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(repl, str) and r\u0022\\g\u003C\u0022 in repl\u0060 appears character-identically in 3 files \u2014 pandas/core/arrays/_arrow_string_mixins.py, pandas/core/arrays/arrow/array.py, pandas/core/arrays/string_arrow.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":"pandas/core/arrays/_arrow_string_mixins.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bf109a90de3c00b2de9f919cadd71cd1bbd4e06834cfedc76ad60d8eceea63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(state, dict) and \u0022_cache\u0022 in state\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/base.py, pandas/core/dtypes/base.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/arrays/base.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d82e3ef952d67a240c8b8bc09297124ca901e8f31f09082ad4c1bf87fbfffeb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, ast.Name) and value.id == attr\u0060 appears character-identically in 2 files \u2014 pandas/core/computation/expr.py, pandas/core/computation/pytables.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":"pandas/core/computation/expr.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3491a0fa2779257df8540fa020067832943f36c28c59b065a00f8c02833506c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, np.ndarray) and value.ndim == 2\u0060 appears character-identically in 3 files \u2014 pandas/core/arrays/datetimelike.py, pandas/core/frame.py, pandas/core/internals/blocks.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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9006871b4c13fecdf8d6bd040f080a69a665491c1317d0a646620eadb96083b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(values, np.ndarray) and values.dtype == np.bool_\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/boolean.py, pandas/core/methods/filter.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":"pandas/core/arrays/boolean.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53c917dd66215b0c3db7442b7205693c936b680f4b7a00790581ef0b6a9b0e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(values, np.ndarray) and values.dtype == object\u0060 appears character-identically in 6 files \u2014 pandas/core/arrays/_mixins.py, pandas/core/arrays/base.py, pandas/core/arrays/masked.py, pandas/core/arrays/sparse/array.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":"pandas/core/arrays/_mixins.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"69332278ae0831c2ac3fa9e3d243710b8e01a83246a1a9dfb86ee6676eeaa722"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isna(key) and key is not self.dtype.na_value\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/arrow/array.py, pandas/core/arrays/masked.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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07fa5151a8f326ee2ce118b929a678bb5c841d4dfa86ab979a83c4ee4d1cf14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keepdims and isinstance(result, np.ndarray)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/datetimes.py, pandas/core/arrays/period.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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7beb5a241c29d1a4de6c66912645b322cca046d2f3fb7388b528910aae455c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060level is not None and not is_list_like(level)\u0060 appears character-identically in 2 files \u2014 pandas/core/indexes/base.py, pandas/core/indexes/multi.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":"pandas/core/indexes/base.py"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b84c1e98d0eff5f3b040ecd0339bb41fa681c143ad903c47130f98576a06d3d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lib.is_np_dtype(dtype, \u0022M\u0022) and is_supported_dtype(dtype)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/_mixins.py, pandas/core/construction.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":"pandas/core/arrays/_mixins.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d6217518b0ac6e7aba3d946f63b51c5aa94776041dea651289a5bc597b2bd7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lib.is_np_dtype(dtype, \u0022M\u0022) or isinstance(dtype, DatetimeTZDtype)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/period.py, pandas/io/pytables.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":"pandas/core/arrays/period.py"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7177be29d228a9645e95898c436babe41df9aca4824cba3d304f238b762c56d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lib.is_np_dtype(dtype, \u0022m\u0022) and is_supported_dtype(dtype)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/_mixins.py, pandas/core/construction.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":"pandas/core/arrays/_mixins.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9b7203b918ed5b900c6bcf08625744dea4aef436bdde176f6050ddce7e9fbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060limit_area is not None and not mask.all()\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/masked.py, pandas/core/missing.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":"pandas/core/arrays/masked.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f5ff619c58ad8a40396af8415bfe1e594c6e216c3f5c20ac0582ede2e9ab3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060na is not lib.no_default and not isna(na)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/arrow/array.py, pandas/core/arrays/string_arrow.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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":4238}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e9be7ecb738cd420b1fb8be12fb3f752b43c1e1175a5ce57bece38315ce4a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not copy and isinstance(data, (ABCSeries, Index))\u0060 appears character-identically in 2 files \u2014 pandas/core/indexes/base.py, pandas/core/indexes/timedeltas.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":"pandas/core/indexes/base.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcca4e857fb0d5919bb9604b2d05c7bae1031567a83ad8a089c8c9b0db4d04e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not copy and isinstance(data, (Index, ABCSeries))\u0060 appears character-identically in 2 files \u2014 pandas/core/indexes/datetimes.py, pandas/core/indexes/period.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":"pandas/core/indexes/datetimes.py"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"2945366f5c32cb48fc7be1ca15e8ad6f397d5bdcccbdfa3f87b94a8876bfb388"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance( other, (list, ExtensionArray, np.ndarray) ) and not ops.has_castable_attr(other)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/boolean.py, pandas/core/arrays/string_.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":"pandas/core/arrays/boolean.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f97abbf82fd0a26786cf85ca86197549bb48766dd7a584c1cd11b323d22744"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance( other, (list, np.ndarray, ExtensionArray) ) and not ops.has_castable_attr(other)\u0060 appears character-identically in 4 files \u2014 pandas/core/arrays/datetimelike.py, pandas/core/arrays/interval.py, pandas/core/arrays/masked.py, pandas/core/arrays/sparse/array.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":"pandas/core/arrays/datetimelike.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5183243e2d047be066499a18f58531c1b37999d6cfd2934c9e2373d1846d815"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(result, cls) or dtype != result.dtype\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/base.py, pandas/core/arrays/masked.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":"pandas/core/arrays/base.py"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f5700bdd56dab414f8b6bc0f0bac2a605cf7475b642e7a70b34b58c8ac94c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, self._scalar_type) and value is not NaT\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/datetimes.py, pandas/core/arrays/timedeltas.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":"pandas/core/arrays/datetimes.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"5940d24ed99733f62ba6ce64dd4a648b4de48439867fbeada8dd773b5ff0fdfe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self._should_compare(target) and not self._should_partial_index(target)\u0060 appears character-identically in 2 files \u2014 pandas/core/indexes/base.py, pandas/core/indexes/interval.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":"pandas/core/indexes/base.py"},"region":{"startLine":3947}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b76cb202510b6ac472ab5bea782db3952269e7cc80d079b1b11b97990bab2ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self.ordered and not self.categories.equals(other.categories)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/categorical.py, pandas/core/indexes/category.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":"pandas/core/arrays/categorical.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81e7fec160df1033c57169fc820816899a2d125d3803b74be6d099c05c665ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pa.types.is_string(pa_type) or pa.types.is_large_string(pa_type)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/arrow/array.py, pandas/core/dtypes/dtypes.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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3353ddcf8e8cd1f676f73c05a61d1b728f8326973ce34879cc9f78ec78ccfaa4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pat is not None and not isinstance(pat, str)\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/arrow/array.py, pandas/core/strings/object_array.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":"pandas/core/arrays/arrow/array.py"},"region":{"startLine":4538}}}],"partialFingerprints":{"codehealthFindingId/v1":"3786bc4e5bbd05323953d68ca8d09487ef424c033acce7f822d1fbec800cc7b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.dtype.na_value is np.nan and name in [\u0022any\u0022, \u0022all\u0022]\u0060 appears character-identically in 2 files \u2014 pandas/core/arrays/string_.py, pandas/core/arrays/string_arrow.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":"pandas/core/arrays/string_.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3487f9e687140dd2b1bb26174a650a15075b159d6c33464254395aa3bcc181d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_monotonic_increasing or self.is_monotonic_decreasing\u0060 appears character-identically in 2 files \u2014 pandas/core/indexes/base.py, pandas/core/indexes/datetimelike.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":"pandas/core/indexes/base.py"},"region":{"startLine":4137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11625e9562fe734c0f36fef43283c59cf9a3b69d76bbf0160f23d565ba4247a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sys.getrefcount( self ) \u003C= REF_COUNT_METHOD and not com.is_local_in_caller_frame(self)\u0060 appears character-identically in 2 files \u2014 pandas/core/frame.py, pandas/core/series.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":"pandas/core/frame.py"},"region":{"startLine":13580}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee47a7cb9f8c287f2209b63085cbb21c3fe33c1adfa6455978bbe972c6037a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sys.getrefcount(self) \u003C= REF_COUNT and not com.is_local_in_caller_frame(self) and com.is_setitem_syntax_in_caller_frame()\u0060 appears character-identically in 2 files \u2014 pandas/core/frame.py, pandas/core/series.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":"pandas/core/frame.py"},"region":{"startLine":4666}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c7bbb73c16ad445f70a7d6bf8b390e6649649bfb78c7e4669e5119ff153152"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get_callable_name\u0060 is public and takes \u0060obj: object\u0060 from its caller, and it calls itself at line 382 (\u0060get_callable_name\u0060) with a piece of \u0060obj\u0060 \u2014 and nowhere in \u0060get_callable_name\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_callable_name\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/common.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4a36c4b53e0c8301281805fce263e7c3b2af8abc8729ca4c1e2da8a0b17f32"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060infer_dtype_from_scalar\u0060 is public and takes \u0060val: object\u0060 from its caller, and it calls itself at line 784 (\u0060infer_dtype_from_scalar\u0060) with a piece of \u0060val\u0060 \u2014 and nowhere in \u0060infer_dtype_from_scalar\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 \u0060infer_dtype_from_scalar\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcffeb18ac2592883c13a90dd5430f660d1014acb19de3f0b089bebac3346a7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060np_can_hold_element\u0060 is public and takes \u0060element: Any\u0060 from its caller, and it calls itself at line 1823 (\u0060np_can_hold_element\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060np_can_hold_element\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 \u0060np_can_hold_element\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/core/dtypes/cast.py"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"41848f42d087ce8bff85276d9ca5099e4486d6b1f258780adf814fc5f68b5c33"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shares_memory\u0060 is public and takes \u0060left: Any\u0060 from its caller, and it calls itself at line 536 (\u0060shares_memory\u0060) with a piece of \u0060left\u0060 (and at line 539, line 540, line 543, line 545, line 547, line 564, line 567, line 571) \u2014 and nowhere in \u0060shares_memory\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 \u0060shares_memory\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pandas/_testing/__init__.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c1fac2a3284debc84903c089b1cc4890c43bf15ec6a246ea7101a3cc422626"}},{"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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f4c35f9042b2fcc5a9b8ada6c6bd4363048e0da9a1bf843bd18ad63555d914"}},{"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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f4c4313298cb27f734d2d9063fc7fa259ca98897bc7780cb35c764e4513b3d"}},{"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":"pandas/plotting/_matplotlib/converter.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ccbda3c0304920dc33c8b57bbb407fb6f1ead159bb99e9496721a4c49ef243"}},{"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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8b47ffe10e11083bb7779fa21ef10c04bdb784431def2484440601898e55bb"}},{"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":"pandas/io/_util.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ae21e0475ee89eb57e6e116f0bf090c6c658576c5746fae3aa62e7b9eeb02b"}},{"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":"pandas/io/parsers/readers.py"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e236d8eed2c05268cb77549fa9ab327037ad987be5e7ec4a66f4238601c71560"}},{"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":"pandas/io/json/_json.py"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c93c5b483e8546423e41d2d30473688cc50086c0070b5c2d0ee66b252f46a55"}},{"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":"pandas/io/json/_json.py"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"030e004830d61859df9276ab5973f7294e946f56a395e54a6651c1344225bc6e"}},{"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":"pandas/core/apply.py"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae20f0e574c7b366fb4d21fd7e2c4de9678c82cbe256295c53fd91c467ce9eb"}},{"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":"pandas/core/frame.py"},"region":{"startLine":15536}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6db962545f4544a84d5ee1c6fabff3f87f80561ea12c0a8f8490c41d4c224e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060condition\u0060 (in \u0060is_string_dtype\u0060) returns \u0060False\u0060 when \u0060TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"pandas/core/dtypes/common.py"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"9942a8f2ca91e95fe1471184b8f3b319961eefbb215826772a364ace98feaf10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060get_label\u0060 (in \u0060_post_plot_logic\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":"pandas/plotting/_matplotlib/core.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"074ea9ac989693a0a492e504a1cabc40444a7cc0605b5dcdc30e903988664c4b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_get_literal_string_prefix_len\u0060 returns \u00600\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"scripts/validate_unwanted_patterns.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d46a168d73c874f79c04a471b7abfe2e29e5bc27aae0f4914012c9289e5ddc2"}}],"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-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-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":"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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":39,"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."]}]}