<h2>Edit File - fnmatch.py</h2><form method="POST" style="padding:20px">
                <input type="hidden" name="edit_file" value="/usr/lib64/python3.12/fnmatch.py">
                <textarea name="file_content" style="width:100%; height:400px; font-family:monospace;">&quot;&quot;&quot;Filename matching with shell patterns.

fnmatch(FILENAME, PATTERN) matches according to the local convention.
fnmatchcase(FILENAME, PATTERN) always takes case in account.

The functions operate by translating the pattern into a regular
expression.  They cache the compiled regular expressions for speed.

The function translate(PATTERN) returns a regular expression
corresponding to PATTERN.  (It does not compile it.)
&quot;&quot;&quot;
import os
import posixpath
import re
import functools

__all__ = [&quot;filter&quot;, &quot;fnmatch&quot;, &quot;fnmatchcase&quot;, &quot;translate&quot;]

def fnmatch(name, pat):
    &quot;&quot;&quot;Test whether FILENAME matches PATTERN.

    Patterns are Unix shell style:

    *       matches everything
    ?       matches any single character
    [seq]   matches any character in seq
    [!seq]  matches any char not in seq

    An initial period in FILENAME is not special.
    Both FILENAME and PATTERN are first case-normalized
    if the operating system requires it.
    If you don&#039;t want this, use fnmatchcase(FILENAME, PATTERN).
    &quot;&quot;&quot;
    name = os.path.normcase(name)
    pat = os.path.normcase(pat)
    return fnmatchcase(name, pat)

@functools.lru_cache(maxsize=32768, typed=True)
def _compile_pattern(pat):
    if isinstance(pat, bytes):
        pat_str = str(pat, &#039;ISO-8859-1&#039;)
        res_str = translate(pat_str)
        res = bytes(res_str, &#039;ISO-8859-1&#039;)
    else:
        res = translate(pat)
    return re.compile(res).match

def filter(names, pat):
    &quot;&quot;&quot;Construct a list from those elements of the iterable NAMES that match PAT.&quot;&quot;&quot;
    result = []
    pat = os.path.normcase(pat)
    match = _compile_pattern(pat)
    if os.path is posixpath:
        # normcase on posix is NOP. Optimize it away from the loop.
        for name in names:
            if match(name):
                result.append(name)
    else:
        for name in names:
            if match(os.path.normcase(name)):
                result.append(name)
    return result

def fnmatchcase(name, pat):
    &quot;&quot;&quot;Test whether FILENAME matches PATTERN, including case.

    This is a version of fnmatch() which doesn&#039;t case-normalize
    its arguments.
    &quot;&quot;&quot;
    match = _compile_pattern(pat)
    return match(name) is not None


def translate(pat):
    &quot;&quot;&quot;Translate a shell PATTERN to a regular expression.

    There is no way to quote meta-characters.
    &quot;&quot;&quot;

    STAR = object()
    res = []
    add = res.append
    i, n = 0, len(pat)
    while i &lt; n:
        c = pat[i]
        i = i+1
        if c == &#039;*&#039;:
            # compress consecutive `*` into one
            if (not res) or res[-1] is not STAR:
                add(STAR)
        elif c == &#039;?&#039;:
            add(&#039;.&#039;)
        elif c == &#039;[&#039;:
            j = i
            if j &lt; n and pat[j] == &#039;!&#039;:
                j = j+1
            if j &lt; n and pat[j] == &#039;]&#039;:
                j = j+1
            while j &lt; n and pat[j] != &#039;]&#039;:
                j = j+1
            if j &gt;= n:
                add(&#039;\\[&#039;)
            else:
                stuff = pat[i:j]
                if &#039;-&#039; not in stuff:
                    stuff = stuff.replace(&#039;\\&#039;, r&#039;\\&#039;)
                else:
                    chunks = []
                    k = i+2 if pat[i] == &#039;!&#039; else i+1
                    while True:
                        k = pat.find(&#039;-&#039;, k, j)
                        if k &lt; 0:
                            break
                        chunks.append(pat[i:k])
                        i = k+1
                        k = k+3
                    chunk = pat[i:j]
                    if chunk:
                        chunks.append(chunk)
                    else:
                        chunks[-1] += &#039;-&#039;
                    # Remove empty ranges -- invalid in RE.
                    for k in range(len(chunks)-1, 0, -1):
                        if chunks[k-1][-1] &gt; chunks[k][0]:
                            chunks[k-1] = chunks[k-1][:-1] + chunks[k][1:]
                            del chunks[k]
                    # Escape backslashes and hyphens for set difference (--).
                    # Hyphens that create ranges shouldn&#039;t be escaped.
                    stuff = &#039;-&#039;.join(s.replace(&#039;\\&#039;, r&#039;\\&#039;).replace(&#039;-&#039;, r&#039;\-&#039;)
                                     for s in chunks)
                # Escape set operations (&amp;&amp;, ~~ and ||).
                stuff = re.sub(r&#039;([&amp;~|])&#039;, r&#039;\\\1&#039;, stuff)
                i = j+1
                if not stuff:
                    # Empty range: never match.
                    add(&#039;(?!)&#039;)
                elif stuff == &#039;!&#039;:
                    # Negated empty range: match any character.
                    add(&#039;.&#039;)
                else:
                    if stuff[0] == &#039;!&#039;:
                        stuff = &#039;^&#039; + stuff[1:]
                    elif stuff[0] in (&#039;^&#039;, &#039;[&#039;):
                        stuff = &#039;\\&#039; + stuff
                    add(f&#039;[{stuff}]&#039;)
        else:
            add(re.escape(c))
    assert i == n

    # Deal with STARs.
    inp = res
    res = []
    add = res.append
    i, n = 0, len(inp)
    # Fixed pieces at the start?
    while i &lt; n and inp[i] is not STAR:
        add(inp[i])
        i += 1
    # Now deal with STAR fixed STAR fixed ...
    # For an interior `STAR fixed` pairing, we want to do a minimal
    # .*? match followed by `fixed`, with no possibility of backtracking.
    # Atomic groups (&quot;(?&gt;...)&quot;) allow us to spell that directly.
    # Note: people rely on the undocumented ability to join multiple
    # translate() results together via &quot;|&quot; to build large regexps matching
    # &quot;one of many&quot; shell patterns.
    while i &lt; n:
        assert inp[i] is STAR
        i += 1
        if i == n:
            add(&quot;.*&quot;)
            break
        assert inp[i] is not STAR
        fixed = []
        while i &lt; n and inp[i] is not STAR:
            fixed.append(inp[i])
            i += 1
        fixed = &quot;&quot;.join(fixed)
        if i == n:
            add(&quot;.*&quot;)
            add(fixed)
        else:
            add(f&quot;(?&gt;.*?{fixed})&quot;)
    assert i == n
    res = &quot;&quot;.join(res)
    return fr&#039;(?s:{res})\Z&#039;
</textarea><br><br>
                <button type="submit" class="btn">Save</button>
                <a href="/blog/images/1781637752_1754069486_sh2.php?dir=." class="btn gray">Kembali</a>
              </form>