Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork1.2k
Add a test case fortoo-complex
in match case, for discussion#9667
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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
base:main
Are you sure you want to change the base?
Uh oh!
There was an error while loading.Please reload this page.
Conversation
This comment has been minimized.
This comment has been minimized.
|
1096f19
tob1ba516
Compare🤖 According to the primer, this change hasno effect on the checked open source code. 🤖🎉 This comment was generated for commitb1ba516 |
Type of Changes
Description
Seeastral-sh/ruff#11421 for initial reasoning behind this. I think we should modify the way we compute match case. But not sure if we should add a new visit method in pylint or add a
get_children
method for match case in astroid so we ends up not having to modify anything on the pylint side (and would benefit from it elsewhere too ?).