Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Backport maintenance/3.0.x] Fixed false positive nested-min-max for nested lists #9337

Merged

Conversation

github-actions[bot]
Copy link
Contributor

Backport da13c74 from #9323.

Nesting is useful for finding the maximum in a matrix.
Therefore, pylint allows nesting of the form:
max(max([[1, 2, 3], [4, 5, 6]]))

Closes #9307

Co-authored-by: Pierre Sassoulas <pierre.sassoulas@gmail.com>
(cherry picked from commit da13c74)
Copy link

codecov bot commented Dec 30, 2023

Codecov Report

All modified and coverable lines are covered by tests ✅

Comparison is base (1a5ffc1) 95.78% compared to head (9ae501a) 95.78%.

Additional details and impacted files

Impacted file tree graph

@@                Coverage Diff                 @@
##           maintenance/3.0.x    #9337   +/-   ##
==================================================
  Coverage              95.78%   95.78%           
==================================================
  Files                    173      173           
  Lines                  18694    18694           
==================================================
  Hits                   17906    17906           
  Misses                   788      788           
Files Coverage Δ
pylint/checkers/nested_min_max.py 100.00% <ø> (ø)

@Pierre-Sassoulas Pierre-Sassoulas merged commit 015c43a into maintenance/3.0.x Dec 30, 2023
25 checks passed
@Pierre-Sassoulas Pierre-Sassoulas deleted the backport-9323-to-maintenance/3.0.x branch December 30, 2023 19:24
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants