Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

GH-130614: pathlib ABCs: revise test suite for path joining #130988

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

Merged
merged 4 commits into from
Mar 9, 2025
Merged
Show file tree
Hide file tree
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
Windows test fixes
  • Loading branch information
barneygale committed Mar 8, 2025
commit 771aeb92908cd5a5b75a05c5742c4dfe0abe25ae
9 changes: 5 additions & 4 deletions 9 Lib/glob.py
Original file line number Diff line number Diff line change
Expand Up @@ -320,11 +320,11 @@ def translate(pat, *, recursive=False, include_hidden=False, seps=None):


@functools.lru_cache(maxsize=512)
def _compile_pattern(pat, sep, case_sensitive, recursive=True):
def _compile_pattern(pat, seps, case_sensitive, recursive=True):
"""Compile given glob pattern to a re.Pattern object (observing case
sensitivity)."""
flags = re.NOFLAG if case_sensitive else re.IGNORECASE
regex = translate(pat, recursive=recursive, include_hidden=True, seps=sep)
regex = translate(pat, recursive=recursive, include_hidden=True, seps=seps)
return re.compile(regex, flags=flags).match


Expand Down Expand Up @@ -360,8 +360,9 @@ def concat_path(path, text):

# High-level methods

def compile(self, pat):
return _compile_pattern(pat, self.sep, self.case_sensitive, self.recursive)
def compile(self, pat, altsep=None):
seps = (self.sep, altsep) if altsep else self.sep
return _compile_pattern(pat, seps, self.case_sensitive, self.recursive)

def selector(self, parts):
"""Returns a function that selects from a given path, walking and
Expand Down
7 changes: 5 additions & 2 deletions 7 Lib/pathlib/types.py
Original file line number Diff line number Diff line change
Expand Up @@ -135,7 +135,10 @@ def with_name(self, name):
split = self.parser.split
if split(name)[0]:
raise ValueError(f"Invalid name {name!r}")
return self.with_segments(split(str(self))[0], name)
path = str(self)
old_name = split(path)[1]
path = path[:len(path) - len(old_name)] + name
return self.with_segments(path)

def with_stem(self, stem):
"""Return a new path with the stem changed."""
Expand Down Expand Up @@ -223,7 +226,7 @@ def full_match(self, pattern, *, case_sensitive=None):
if case_sensitive is None:
case_sensitive = self.parser.normcase('Aa') == 'Aa'
globber = _PathGlobber(pattern.parser.sep, case_sensitive, recursive=True)
match = globber.compile(str(pattern))
match = globber.compile(str(pattern), altsep=self.parser.altsep)
return match(str(self)) is not None


Expand Down
38 changes: 20 additions & 18 deletions 38 Lib/test/test_pathlib/test_join.py
Original file line number Diff line number Diff line change
Expand Up @@ -49,30 +49,32 @@ def with_segments(self, *pathsegments):

def test_join(self):
P = self.cls
p = P('a/b')
sep = self.cls.parser.sep
p = P(f'a{sep}b')
pp = p.joinpath('c')
self.assertEqual(pp, P('a/b/c'))
self.assertEqual(pp, P(f'a{sep}b{sep}c'))
self.assertIs(type(pp), type(p))
pp = p.joinpath('c', 'd')
self.assertEqual(pp, P('a/b/c/d'))
pp = p.joinpath('/c')
self.assertEqual(pp, P('/c'))
self.assertEqual(pp, P(f'a{sep}b{sep}c{sep}d'))
pp = p.joinpath(f'{sep}c')
self.assertEqual(pp, P(f'{sep}c'))

def test_div(self):
# Basically the same as joinpath().
P = self.cls
p = P('a/b')
sep = self.cls.parser.sep
p = P(f'a{sep}b')
pp = p / 'c'
self.assertEqual(pp, P('a/b/c'))
self.assertEqual(pp, P(f'a{sep}b{sep}c'))
self.assertIs(type(pp), type(p))
pp = p / 'c/d'
self.assertEqual(pp, P('a/b/c/d'))
pp = p / f'c{sep}d'
self.assertEqual(pp, P(f'a{sep}b{sep}c{sep}d'))
pp = p / 'c' / 'd'
self.assertEqual(pp, P('a/b/c/d'))
self.assertEqual(pp, P(f'a{sep}b{sep}c{sep}d'))
pp = 'c' / p / 'd'
self.assertEqual(pp, P('c/a/b/d'))
pp = p/ '/c'
self.assertEqual(pp, P('/c'))
self.assertEqual(pp, P(f'c{sep}a{sep}b{sep}d'))
pp = p/ f'{sep}c'
self.assertEqual(pp, P(f'{sep}c'))

def test_full_match(self):
P = self.cls
Expand Down Expand Up @@ -149,11 +151,11 @@ def test_parts(self):
# `parts` returns a tuple.
sep = self.cls.parser.sep
P = self.cls
p = P('a/b')
p = P(f'a{sep}b')
parts = p.parts
self.assertEqual(parts, ('a', 'b'))
# When the path is absolute, the anchor is a separate part.
p = P('/a/b')
p = P(f'{sep}a{sep}b')
parts = p.parts
self.assertEqual(parts, (sep, 'a', 'b'))

Expand Down Expand Up @@ -223,9 +225,9 @@ def test_anchor(self):
P = self.cls
sep = self.cls.parser.sep
self.assertEqual(P('').anchor, '')
self.assertEqual(P('a/b').anchor, '')
self.assertEqual(P('/').anchor, sep)
self.assertEqual(P('/a/b').anchor, sep)
self.assertEqual(P(f'a{sep}b').anchor, '')
self.assertEqual(P(sep).anchor, sep)
self.assertEqual(P(f'{sep}a{sep}b').anchor, sep)

def test_name(self):
P = self.cls
Expand Down
Loading
Morty Proxy This is a proxified and sanitized view of the page, visit original site.