Skip to content

gh-160501: Cover the UCS4 adaptive search path in test_str #160502

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.

Sign up for GitHub

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

Open
wlkr73 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

gh-160501: Cover the UCS4 adaptive search path in test_str #160502

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
16 changes: 16 additions & 0 deletions Lib/test/test_str.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -267,6 +267,22 @@ class MyStr(str):
pass
self.checkequal(3, MyStr('aaa'), 'count', 'a')

def test_find_adaptive_nonbmp(self):
# The adaptive path in Objects/stringlib/fastsearch.h needs a haystack
# of at least 2500 characters and a needle of at least 100, with the
# needle at least a third of the haystack. test_adaptive_find only
# uses ASCII, so the UCS4 variant of adaptive_find never ran.
a, b = '\U0001d11e', '\U0001d11f'
for N in 1000, 10_000:
A, B = a * N, b * N
haystack = A + A + B + A + A
needle = A + B + B + A
self.assertEqual(haystack.find(needle), -1)
self.assertEqual(haystack.count(needle), 0)
combined = haystack + needle
self.assertEqual(combined.find(needle), len(haystack))
self.assertEqual(combined.count(needle), 1)

def test_find(self):
string_tests.StringLikeTest.test_find(self)
# test implementation details of the memchr fast path
Expand Down
Loading