types: constrain tim sort items to Comparable - #15432
Merged
cclauss merged 2 commits intoSep 24, 2026
Merged
Conversation
cclauss
enabled auto-merge (squash)
September 24, 2026 14:26
cclauss
disabled auto-merge
September 24, 2026 14:26
cclauss
approved these changes
Sep 24, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary: make TimSort helpers preserve a bounded comparable element type; accept any comparable sequence while returning list[T]; express comparisons using < only; add TimSort to the shared comparable-item and rejection test batteries. Validation: python -m doctest sorts/tim_sort.py; python -m pytest tests/test_sorts.py -q (345 passed); python -m compileall -q sorts/tim_sort.py tests/test_sorts.py; git diff --check. Part of #15234.