|
| 1 | +# ruff: noqa |
| 2 | +# fmt: off |
| 3 | +# type: ignore |
| 4 | +""" |
| 5 | +This file includes unmodified functions copied from Python 3.13's standard library |
| 6 | +for use on older Python versions. |
| 7 | +
|
| 8 | +Functions copied: |
| 9 | +- glob.translate (from Lib/glob.py) |
| 10 | +- fnmatch._translate (from Lib/fnmatch.py) |
| 11 | +
|
| 12 | +Source: https://github.com/python/cpython |
| 13 | +License: Python Software Foundation License Version 2 |
| 14 | +Copyright (c) 2001-2024 Python Software Foundation; All Rights Reserved |
| 15 | +
|
| 16 | +Please delete me if/when this project releases forcing python >= 3.13 |
| 17 | +""" |
| 18 | + |
| 19 | +import os |
| 20 | +import re |
| 21 | + |
| 22 | + |
| 23 | +# Copied from python 3.13 fnmatch._translate |
| 24 | +def _translate(pat, STAR, QUESTION_MARK): |
| 25 | + res = [] |
| 26 | + add = res.append |
| 27 | + i, n = 0, len(pat) |
| 28 | + while i < n: |
| 29 | + c = pat[i] |
| 30 | + i = i+1 |
| 31 | + if c == '*': |
| 32 | + # compress consecutive `*` into one |
| 33 | + if (not res) or res[-1] is not STAR: |
| 34 | + add(STAR) |
| 35 | + elif c == '?': |
| 36 | + add(QUESTION_MARK) |
| 37 | + elif c == '[': |
| 38 | + j = i |
| 39 | + if j < n and pat[j] == '!': |
| 40 | + j = j+1 |
| 41 | + if j < n and pat[j] == ']': |
| 42 | + j = j+1 |
| 43 | + while j < n and pat[j] != ']': |
| 44 | + j = j+1 |
| 45 | + if j >= n: |
| 46 | + add('\\[') |
| 47 | + else: |
| 48 | + stuff = pat[i:j] |
| 49 | + if '-' not in stuff: |
| 50 | + stuff = stuff.replace('\\', r'\\') |
| 51 | + else: |
| 52 | + chunks = [] |
| 53 | + k = i+2 if pat[i] == '!' else i+1 |
| 54 | + while True: |
| 55 | + k = pat.find('-', k, j) |
| 56 | + if k < 0: |
| 57 | + break |
| 58 | + chunks.append(pat[i:k]) |
| 59 | + i = k+1 |
| 60 | + k = k+3 |
| 61 | + chunk = pat[i:j] |
| 62 | + if chunk: |
| 63 | + chunks.append(chunk) |
| 64 | + else: |
| 65 | + chunks[-1] += '-' |
| 66 | + # Remove empty ranges -- invalid in RE. |
| 67 | + for k in range(len(chunks)-1, 0, -1): |
| 68 | + if chunks[k-1][-1] > chunks[k][0]: |
| 69 | + chunks[k-1] = chunks[k-1][:-1] + chunks[k][1:] |
| 70 | + del chunks[k] |
| 71 | + # Escape backslashes and hyphens for set difference (--). |
| 72 | + # Hyphens that create ranges shouldn't be escaped. |
| 73 | + stuff = '-'.join(s.replace('\\', r'\\').replace('-', r'\-') |
| 74 | + for s in chunks) |
| 75 | + # Escape set operations (&&, ~~ and ||). |
| 76 | + stuff = re.sub(r'([&~|])', r'\\\1', stuff) |
| 77 | + i = j+1 |
| 78 | + if not stuff: |
| 79 | + # Empty range: never match. |
| 80 | + add('(?!)') |
| 81 | + elif stuff == '!': |
| 82 | + # Negated empty range: match any character. |
| 83 | + add('.') |
| 84 | + else: |
| 85 | + if stuff[0] == '!': |
| 86 | + stuff = '^' + stuff[1:] |
| 87 | + elif stuff[0] in ('^', '['): |
| 88 | + stuff = '\\' + stuff |
| 89 | + add(f'[{stuff}]') |
| 90 | + else: |
| 91 | + add(re.escape(c)) |
| 92 | + assert i == n |
| 93 | + return res |
| 94 | + |
| 95 | + |
| 96 | +def translate(pat, *, recursive=False, include_hidden=False, seps=None): |
| 97 | + """Translate a pathname with shell wildcards to a regular expression. |
| 98 | +
|
| 99 | + If `recursive` is true, the pattern segment '**' will match any number of |
| 100 | + path segments. |
| 101 | +
|
| 102 | + If `include_hidden` is true, wildcards can match path segments beginning |
| 103 | + with a dot ('.'). |
| 104 | +
|
| 105 | + If a sequence of separator characters is given to `seps`, they will be |
| 106 | + used to split the pattern into segments and match path separators. If not |
| 107 | + given, os.path.sep and os.path.altsep (where available) are used. |
| 108 | + """ |
| 109 | + if not seps: |
| 110 | + if os.path.altsep: |
| 111 | + seps = (os.path.sep, os.path.altsep) |
| 112 | + else: |
| 113 | + seps = os.path.sep |
| 114 | + escaped_seps = ''.join(map(re.escape, seps)) |
| 115 | + any_sep = f'[{escaped_seps}]' if len(seps) > 1 else escaped_seps |
| 116 | + not_sep = f'[^{escaped_seps}]' |
| 117 | + if include_hidden: |
| 118 | + one_last_segment = f'{not_sep}+' |
| 119 | + one_segment = f'{one_last_segment}{any_sep}' |
| 120 | + any_segments = f'(?:.+{any_sep})?' |
| 121 | + any_last_segments = '.*' |
| 122 | + else: |
| 123 | + one_last_segment = f'[^{escaped_seps}.]{not_sep}*' |
| 124 | + one_segment = f'{one_last_segment}{any_sep}' |
| 125 | + any_segments = f'(?:{one_segment})*' |
| 126 | + any_last_segments = f'{any_segments}(?:{one_last_segment})?' |
| 127 | + |
| 128 | + results = [] |
| 129 | + parts = re.split(any_sep, pat) |
| 130 | + last_part_idx = len(parts) - 1 |
| 131 | + for idx, part in enumerate(parts): |
| 132 | + if part == '*': |
| 133 | + results.append(one_segment if idx < last_part_idx else one_last_segment) |
| 134 | + elif recursive and part == '**': |
| 135 | + if idx < last_part_idx: |
| 136 | + if parts[idx + 1] != '**': |
| 137 | + results.append(any_segments) |
| 138 | + else: |
| 139 | + results.append(any_last_segments) |
| 140 | + else: |
| 141 | + if part: |
| 142 | + if not include_hidden and part[0] in '*?': |
| 143 | + results.append(r'(?!\.)') |
| 144 | + results.extend(_translate(part, f'{not_sep}*', not_sep)) |
| 145 | + if idx < last_part_idx: |
| 146 | + results.append(any_sep) |
| 147 | + res = ''.join(results) |
| 148 | + return fr'(?s:{res})\Z' |
0 commit comments