mirror of
https://github.com/python/cpython.git
synced 2025-08-19 00:00:48 +00:00
[3.12] gh-106752: Sync with zipp 3.16.2 (GH-106757) (#106777)
gh-106752: Sync with zipp 3.16.2 (GH-106757)
* gh-106752: Sync with zipp 3.16.2
* Add blurb
(cherry picked from commit 22980dc7c9
)
Co-authored-by: Jason R. Coombs <jaraco@jaraco.com>
This commit is contained in:
parent
e99b69c5ae
commit
060f58d877
6 changed files with 204 additions and 27 deletions
|
@ -1,5 +1,9 @@
|
|||
import unittest
|
||||
import io
|
||||
import itertools
|
||||
import math
|
||||
import re
|
||||
import string
|
||||
import unittest
|
||||
import zipfile
|
||||
|
||||
from ._functools import compose
|
||||
|
@ -9,9 +13,11 @@ from ._support import import_or_skip
|
|||
|
||||
|
||||
big_o = import_or_skip('big_o')
|
||||
pytest = import_or_skip('pytest')
|
||||
|
||||
|
||||
class TestComplexity(unittest.TestCase):
|
||||
@pytest.mark.flaky
|
||||
def test_implied_dirs_performance(self):
|
||||
best, others = big_o.big_o(
|
||||
compose(consume, zipfile.CompleteDirs._implied_dirs),
|
||||
|
@ -22,3 +28,76 @@ class TestComplexity(unittest.TestCase):
|
|||
min_n=1,
|
||||
)
|
||||
assert best <= big_o.complexities.Linear
|
||||
|
||||
def make_zip_path(self, depth=1, width=1) -> zipfile.Path:
|
||||
"""
|
||||
Construct a Path with width files at every level of depth.
|
||||
"""
|
||||
zf = zipfile.ZipFile(io.BytesIO(), mode='w')
|
||||
pairs = itertools.product(self.make_deep_paths(depth), self.make_names(width))
|
||||
for path, name in pairs:
|
||||
zf.writestr(f"{path}{name}.txt", b'')
|
||||
zf.filename = "big un.zip"
|
||||
return zipfile.Path(zf)
|
||||
|
||||
@classmethod
|
||||
def make_names(cls, width, letters=string.ascii_lowercase):
|
||||
"""
|
||||
>>> list(TestComplexity.make_names(2))
|
||||
['a', 'b']
|
||||
>>> list(TestComplexity.make_names(30))
|
||||
['aa', 'ab', ..., 'bd']
|
||||
"""
|
||||
# determine how many products are needed to produce width
|
||||
n_products = math.ceil(math.log(width, len(letters)))
|
||||
inputs = (letters,) * n_products
|
||||
combinations = itertools.product(*inputs)
|
||||
names = map(''.join, combinations)
|
||||
return itertools.islice(names, width)
|
||||
|
||||
@classmethod
|
||||
def make_deep_paths(cls, depth):
|
||||
return map(cls.make_deep_path, range(depth))
|
||||
|
||||
@classmethod
|
||||
def make_deep_path(cls, depth):
|
||||
return ''.join(('d/',) * depth)
|
||||
|
||||
def test_baseline_regex_complexity(self):
|
||||
best, others = big_o.big_o(
|
||||
lambda path: re.fullmatch(r'[^/]*\\.txt', path),
|
||||
self.make_deep_path,
|
||||
max_n=100,
|
||||
min_n=1,
|
||||
)
|
||||
assert best <= big_o.complexities.Constant
|
||||
|
||||
@pytest.mark.flaky
|
||||
def test_glob_depth(self):
|
||||
best, others = big_o.big_o(
|
||||
lambda path: consume(path.glob('*.txt')),
|
||||
self.make_zip_path,
|
||||
max_n=100,
|
||||
min_n=1,
|
||||
)
|
||||
assert best <= big_o.complexities.Quadratic
|
||||
|
||||
@pytest.mark.flaky
|
||||
def test_glob_width(self):
|
||||
best, others = big_o.big_o(
|
||||
lambda path: consume(path.glob('*.txt')),
|
||||
lambda size: self.make_zip_path(width=size),
|
||||
max_n=100,
|
||||
min_n=1,
|
||||
)
|
||||
assert best <= big_o.complexities.Linear
|
||||
|
||||
@pytest.mark.flaky
|
||||
def test_glob_width_and_depth(self):
|
||||
best, others = big_o.big_o(
|
||||
lambda path: consume(path.glob('*.txt')),
|
||||
lambda size: self.make_zip_path(depth=size, width=size),
|
||||
max_n=10,
|
||||
min_n=1,
|
||||
)
|
||||
assert best <= big_o.complexities.Linear
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue