8000 bpo-41972: Use the "Two-Way" algorithm when searching for long substrings by sweeneyde · Pull Request #22679 · python/cpython · GitHub
[go: up one dir, main page]

Skip to content

bpo-41972: Use the "Two-Way" algorithm when searching for long substrings #22679

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

Closed
wants to merge 21 commits into from
Closed
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update 2020-10-12-23-46-49.bpo-41972.0pHodE.rst
  • Loading branch information
sweeneyde authored Oct 17, 2020
commit c3313075db46012570f2e754414ae8942b03a41e
Original file line number Diff line number Diff line change
@@ -1 +1 @@
Substring search functions such as ``str1 in str2`` and ``str2.find(str1)`` now use the "Two-Way" string comparison algorithm to avoid quadratic behavior in the worst cases.
Substring search functions such as ``str1 in str2`` and ``str2.find(str1)`` now use the "Two-Way" string comparison algorithm whenever ``str1`` is long enough, to avoid quadratic behavior in the worst cases.
0