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

bpo-46705: Memory optimization for set.issubset #31267

Closed
wants to merge 1 commit into from

Conversation

SimpleArt
Copy link

@SimpleArt SimpleArt commented Feb 11, 2022

Instead of using set(other) during set.issubset, use self.intersection(other) to avoid using unnecessary memory.

https://bugs.python.org/issue46705

Optimized `set.issubset` to use `O(min(len(self), len(set(other))))` memory instead of `O(len(set(other))) memory by using `self.intersection(other)` instead of `set(other)`.

https://bugs.python.org/issue46705
@the-knights-who-say-ni
Copy link

Hello, and thanks for your contribution!

I'm a bot set up to make sure that the project can legally accept this contribution by verifying everyone involved has signed the PSF contributor agreement (CLA).

CLA Missing

Our records indicate the following people have not signed the CLA:

@SimpleArt

For legal reasons we need all the people listed to sign the CLA before we can look at your contribution. Please follow the steps outlined in the CPython devguide to rectify this issue.

If you have recently signed the CLA, please wait at least one business day
before our records are updated.

You can check yourself to see if the CLA has been received.

Thanks again for the contribution, we look forward to reviewing it!

@serhiy-storchaka
Copy link
Member

The idea LGTM, but the implementation contains some errors (it misuses the C boolean as the Python boolean). Closed in favor of #92799.

@SimpleArt SimpleArt deleted the patch-1 branch July 30, 2022 05:36
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants