languages/cpython
languages/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython synced 2024-10-14 09:58:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

gh-110160: Fix flaky test_find_periodic_pattern in string_tests (#110170)

Browse source
This commit is contained in:
Nikita Sobolev 2023-10-01 17:20:01 +03:00 committed by GitHub
parent 038c3564fb
commit 06faa9a39b
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 11 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
Lib/test/string_tests.py
View file

@ -327,11 +327,12 @@ def reference_find(p, s):
for i in range(len(s)):
if s.startswith(p, i):
return i
if p == '' and s == '':
return 0
return -1
rr = random.randrange
choices = random.choices
for _ in range(1000):
def check_pattern(rr):
choices = random.choices
p0 = ''.join(choices('abcde', k=rr(10))) * rr(10, 20)
p = p0[:len(p0) - rr(10)] # pop off some characters
left = ''.join(choices('abcdef', k=rr(2000)))
@ -341,6 +342,13 @@ def reference_find(p, s):
self.checkequal(reference_find(p, text),
text, 'find', p)
rr = random.randrange
for _ in range(1000):
check_pattern(rr)
# Test that empty string always work:
check_pattern(lambda *args: 0)
def test_find_many_lengths(self):
haystack_repeats = [a * 10**e for e in range(6) for a in (1,2,5)]
haystacks = [(n, self.fixtype("abcab"*n + "da")) for n in haystack_repeats]