Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork32.4k
gh-133530: Differentiate between min/max heaps more#133613
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
Doc/library/heapq.rst Outdated
| @@ -170,7 +170,7 @@ The module also offers three general purpose functions based on heaps. | |||
| *reverse* is a boolean value. If set to ``True``, then the input elements | |||
| are merged as if each comparison were reversed. To achieve behavior similar | |||
| to ``sorted(itertools.chain(*iterables), reverse=True)``, all iterables must | |||
| be sorted from largest to smallest. | |||
| be sorted from largest to smallest, like for example, a max-heap. | |||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
The inputs must besorted, general max-heaps aren't acceptable.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
This has conflicts.
Uh oh!
There was an error while loading.Please reload this page.
heapqdocumentation #133530📚 Documentation preview 📚:https://cpython-previews--133613.org.readthedocs.build/