1
  
   Ã239ÂÅÄ  ï    <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html><head>
<title>403 Forbidden</title>
</head><body>
<h1>Forbidden</h1>
<p>You don't have permission to access this resource.</p>
</body></html>
  $   ˆÉÈÇ609Æa–Ým_JJi?u8 \¸Ó7 %1hßÅ a    ‹      Õ–]oÚ0†ïû+<_ìÖõ#xêÒP) –iš¦©2±!V;²Œþú98m³©hT¢»:ÇÉŸ÷qü¾‹FÝÉ÷q}™\ÐøëçA¿‹pà[«M"ÿ¢]o ½!F8±6?X­VõU«®ô&×�Ø,mƒ±ZÄ¶Î,Ãä(,ž‘#&œ2Qh…M9éKÆ!5C ÖÆÛ�kƒM´ÖOg •²`Ö_Š˜›"·<ƒŒgJ¯ËÐ>©o”Í q‚/áŠBY5œ*¶.Ì¯[Øõ¿A¤ÓMý"Õ$´	ZÒTÌe[•cŠlŽŒŽ;D¬¤�iJå]}.fÑÔvð�~wôÓéœ©âkRäÜÍ:øS·3<u"L†4ã!Ðç5WNs�É€‹2ÅÄLp¶U|ãÅ7â~{‡‘×DÜÄZäV(ù$‡XE�UjrêX?8‚DWU^Âþ54þc0Æ×½á$ê_û!aEOîöö1SÍ¥E‘Ð<¶îUÉè¾—S“Ÿ?4QI Å<±˜ TCÏ*_€=S)ãº
¾ùÁ¯�U—Ùj6šÇµ ¨§(øxÖ8Fèý/ä�T+Yp³âY %S!9&>î Ðl íÖV ·3]¾!@ž¬Í­ŸU˜T;£´N
E›bI²Éd÷E‘«×nQø¸ÿo¼(´ÛŽ–ÅÁ�Écz(¿áÆRë6áPìï>‹ÌbZá1ÿ·Ø_º³÷ðÆó¨èˆÝÞ+É&•ÆëÏ©ï2PÞòBØ\.Cð7ÝßÐÚ~¢L    C   ˆl–Ãa¾”Ê:”Ê�~ão\må1hß�þY#ò,Ü¢�×FP	§�üÿÂ„m…ßÉ_ŠI|¥�+Wé3ž¯ÀÇ <�    import re
import itertools
import textwrap
import functools

try:
    from importlib.resources import files  # type: ignore
except ImportError:  # pragma: nocover
    from setuptools.extern.importlib_resources import files  # type: ignore

from setuptools.extern.jaraco.functools import compose, method_cache
from setuptools.extern.jaraco.context import ExceptionTrap


def substitution(old, new):
    """
    Return a function that will perform a substitution on a string
    """
    return lambda s: s.replace(old, new)


def multi_substitution(*substitutions):
    """
    Take a sequence of pairs specifying substitutions, and create
    a function that performs those substitutions.

    >>> multi_substitution(('foo', 'bar'), ('bar', 'baz'))('foo')
    'baz'
    """
    substitutions = itertools.starmap(substitution, substitutions)
    # compose function applies last function first, so reverse the
    #  substitutions to get the expected order.
    substitutions = reversed(tuple(substitutions))
    return compose(*substitutions)


class FoldedCase(str):
    """
    A case insensitive string class; behaves just like str
    except compares equal when the only variation is case.

    >>> s = FoldedCase('hello world')

    >>> s == 'Hello World'
    True

    >>> 'Hello World' == s
    True

    >>> s != 'Hello World'
    False

    >>> s.index('O')
    4

    >>> s.split('O')
    ['hell', ' w', 'rld']

    >>> sorted(map(FoldedCase, ['GAMMA', 'alpha', 'Beta']))
    ['alpha', 'Beta', 'GAMMA']

    Sequence membership is straightforward.

    >>> "Hello World" in [s]
    True
    >>> s in ["Hello World"]
    True

    You may test for set inclusion, but candidate and elements
    must both be folded.

    >>> FoldedCase("Hello World") in {s}
    True
    >>> s in {FoldedCase("Hello World")}
    True

    String inclusion works as long as the FoldedCase object
    is on the right.

    >>> "hello" in FoldedCase("Hello World")
    True

    But not if the FoldedCase object is on the left:

    >>> FoldedCase('hello') in 'Hello World'
    False

    In that case, use ``in_``:

    >>> FoldedCase('hello').in_('Hello World')
    True

    >>> FoldedCase('hello') > FoldedCase('Hello')
    False
    """

    def __lt__(self, other):
        return self.lower() < other.lower()

    def __gt__(self, other):
        return self.lower() > other.lower()

    def __eq__(self, other):
        return self.lower() == other.lower()

    def __ne__(self, other):
        return self.lower() != other.lower()

    def __hash__(self):
        return hash(self.lower())

    def __contains__(self, other):
        return super().lower().__contains__(other.lower())

    def in_(self, other):
        "Does self appear in other?"
        return self in FoldedCase(other)

    # cache lower since it's likely to be called frequently.
    @method_cache
    def lower(self):
        return super().lower()

    def index(self, sub):
        return self.lower().index(sub.lower())

    def split(self, splitter=' ', maxsplit=0):
        pattern = re.compile(re.escape(s