Repository navigation
[3.13] gh-149079: Fix O(n^2) canonical ordering in unicodedata.normalize() (GH-149080) - #150780
Merged
Merged
Conversation
…normalize() (pythonGH-149080) Replace the insertion sort used for canonical ordering of combining characters with a hybrid approach: insertion sort for short runs (< 20) and counting sort for longer runs, reducing worst-case complexity from O(n^2) to O(n). This prevents denial of service via crafted Unicode strings with many combining characters in alternating CCC order. (cherry picked from commit 991224b) Co-authored-by: Seth Larson <[email protected]> Co-authored-by: ch4n3-yoon <[email protected]> Co-authored-by: Seokchan Yoon <[email protected]> Co-authored-by: Stan Ulbrych <[email protected]> Co-authored-by: Bénédikt Tran <[email protected]> Co-authored-by: Petr Viktorin <[email protected]> Co-authored-by: Serhiy Storchaka <[email protected]> Co-authored-by: Maurycy Pawłowski-Wieroński <[email protected]>
encukou
added
needs backport to 3.10
needs backport to 3.11
Documentation build overview
454 files changed ·
|
Member
|
Oh, ya' beat me to it! :-) I just wrote the same PR. |
StanFromIreland
approved these changes
Jun 2, 2026
Member
Author
|
Sorry! |
encukou
enabled auto-merge (squash)
June 2, 2026 11:56
Member
Oh no worries, I'm the one who's sorry! |
|
Thanks @encukou for the PR 🌮🎉.. I'm working now to backport this PR to: 3.10, 3.11, 3.12. |
|
Sorry, @encukou, I could not cleanly backport this to |
|
Sorry, @encukou, I could not cleanly backport this to |
|
Sorry, @encukou, I could not cleanly backport this to |
StanFromIreland
removed
needs backport to 3.10
needs backport to 3.11
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
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.
Replace the insertion sort used for canonical ordering of combining
characters with a hybrid approach: insertion sort for short runs (< 20)
and counting sort for longer runs, reducing worst-case complexity from
O(n^2) to O(n). This prevents denial of service via crafted Unicode
strings with many combining characters in alternating CCC order.
(cherry picked from commit 991224b)
Co-authored-by: Seth Larson [email protected]
Co-authored-by: ch4n3-yoon [email protected]
Co-authored-by: Seokchan Yoon [email protected]
Co-authored-by: Stan Ulbrych [email protected]
Co-authored-by: Bénédikt Tran [email protected]
Co-authored-by: Petr Viktorin [email protected]
Co-authored-by: Serhiy Storchaka [email protected]
Co-authored-by: Maurycy Pawłowski-Wieroński [email protected]
unicodedata.normalize("NFC")canonical ordering #149079