File Manager

X7ROOT File Manager

Current Path: /opt/alt/python313/lib64/python3.13

opt / alt / python313 / lib64 / python3.13 /

ðŸ“ ..
ðŸ“„ LICENSE.txt(13.49 KB)
ðŸ“„ __future__.py(5.1 KB)
ðŸ“„ __hello__.py(227 B)
ðŸ“ __pycache__
ðŸ“„ _aix_support.py(3.93 KB)
ðŸ“„ _android_support.py(6.73 KB)
ðŸ“„ _apple_support.py(2.2 KB)
ðŸ“„ _collections_abc.py(31.51 KB)
ðŸ“„ _colorize.py(2.78 KB)
ðŸ“„ _compat_pickle.py(8.53 KB)
ðŸ“„ _compression.py(5.55 KB)
ðŸ“„ _ios_support.py(2.61 KB)
ðŸ“„ _markupbase.py(14.31 KB)
ðŸ“„ _opcode_metadata.py(9.05 KB)
ðŸ“„ _osx_support.py(21.51 KB)
ðŸ“„ _py_abc.py(6.04 KB)
ðŸ“„ _pydatetime.py(89.83 KB)
ðŸ“„ _pydecimal.py(221.96 KB)
ðŸ“„ _pyio.py(91.1 KB)
ðŸ“„ _pylong.py(11.55 KB)
ðŸ“ _pyrepl
ðŸ“„ _sitebuiltins.py(3.05 KB)
ðŸ“„ _strptime.py(28.69 KB)
ðŸ“„ _sysconfigdata__linux_x86_64-linux-gnu.py(65.62 KB)
ðŸ“„ _sysconfigdata_d_linux_x86_64-linux-gnu.py(65.6 KB)
ðŸ“„ _threading_local.py(7.05 KB)
ðŸ“„ _weakrefset.py(5.75 KB)
ðŸ“„ abc.py(6.38 KB)
ðŸ“„ antigravity.py(500 B)
ðŸ“„ argparse.py(99.27 KB)
ðŸ“„ ast.py(63.91 KB)
ðŸ“ asyncio
ðŸ“„ base64.py(21.14 KB)
ðŸ“„ bdb.py(34.51 KB)
ðŸ“„ bisect.py(3.34 KB)
ðŸ“„ bz2.py(11.69 KB)
ðŸ“„ cProfile.py(6.48 KB)
ðŸ“„ calendar.py(25.47 KB)
ðŸ“„ cmd.py(14.96 KB)
ðŸ“„ code.py(12.86 KB)
ðŸ“„ codecs.py(36.06 KB)
ðŸ“„ codeop.py(5.69 KB)
ðŸ“ collections
ðŸ“„ colorsys.py(3.97 KB)
ðŸ“„ compileall.py(20.18 KB)
ðŸ“ concurrent
ðŸ“ config-3.13-x86_64-linux-gnu
ðŸ“„ configparser.py(52.51 KB)
ðŸ“„ contextlib.py(27.15 KB)
ðŸ“„ contextvars.py(129 B)
ðŸ“„ copy.py(8.76 KB)
ðŸ“„ copyreg.py(7.44 KB)
ðŸ“„ csv.py(18.73 KB)
ðŸ“ ctypes
ðŸ“ curses
ðŸ“„ dataclasses.py(63.03 KB)
ðŸ“„ datetime.py(268 B)
ðŸ“ dbm
ðŸ“„ decimal.py(2.73 KB)
ðŸ“„ difflib.py(81.41 KB)
ðŸ“„ dis.py(40 KB)
ðŸ“„ doctest.py(106.77 KB)
ðŸ“ email
ðŸ“ encodings
ðŸ“ ensurepip
ðŸ“„ enum.py(83.48 KB)
ðŸ“„ filecmp.py(10.4 KB)
ðŸ“„ fileinput.py(15.35 KB)
ðŸ“„ fnmatch.py(6.04 KB)
ðŸ“„ fractions.py(39.08 KB)
ðŸ“„ ftplib.py(33.92 KB)
ðŸ“„ functools.py(38.21 KB)
ðŸ“„ genericpath.py(5.84 KB)
ðŸ“„ getopt.py(7.31 KB)
ðŸ“„ getpass.py(6.09 KB)
ðŸ“„ gettext.py(21.03 KB)
ðŸ“„ glob.py(19.26 KB)
ðŸ“„ graphlib.py(9.42 KB)
ðŸ“„ gzip.py(24.06 KB)
ðŸ“„ hashlib.py(9.13 KB)
ðŸ“„ heapq.py(22.48 KB)
ðŸ“„ hmac.py(7.54 KB)
ðŸ“ html
ðŸ“ http
ðŸ“„ imaplib.py(52.77 KB)
ðŸ“ importlib
ðŸ“„ inspect.py(124.36 KB)
ðŸ“„ io.py(3.5 KB)
ðŸ“„ ipaddress.py(79.23 KB)
ðŸ“ json
ðŸ“„ keyword.py(1.05 KB)
ðŸ“ lib-dynload
ðŸ“„ linecache.py(7.11 KB)
ðŸ“„ locale.py(77.13 KB)
ðŸ“ logging
ðŸ“„ lzma.py(13.08 KB)
ðŸ“„ mailbox.py(79.73 KB)
ðŸ“„ mimetypes.py(23.29 KB)
ðŸ“„ modulefinder.py(23.23 KB)
ðŸ“ multiprocessing
ðŸ“„ netrc.py(6.76 KB)
ðŸ“„ ntpath.py(31.54 KB)
ðŸ“„ nturl2path.py(2.32 KB)
ðŸ“„ numbers.py(11.2 KB)
ðŸ“„ opcode.py(2.76 KB)
ðŸ“„ operator.py(10.72 KB)
ðŸ“„ optparse.py(58.95 KB)
ðŸ“„ os.py(40.62 KB)
ðŸ“ pathlib
ðŸ“„ pdb.py(88.81 KB)
ðŸ“„ pickle.py(65.39 KB)
ðŸ“„ pickletools.py(91.85 KB)
ðŸ“„ pkgutil.py(17.85 KB)
ðŸ“„ platform.py(46.25 KB)
ðŸ“„ plistlib.py(29.1 KB)
ðŸ“„ poplib.py(14.26 KB)
ðŸ“„ posixpath.py(17.53 KB)
ðŸ“„ pprint.py(23.59 KB)
ðŸ“„ profile.py(22.61 KB)
ðŸ“„ pstats.py(28.61 KB)
ðŸ“„ pty.py(5.99 KB)
ðŸ“„ py_compile.py(7.65 KB)
ðŸ“„ pyclbr.py(11.13 KB)
ðŸ“„ pydoc.py(107.49 KB)
ðŸ“ pydoc_data
ðŸ“„ queue.py(13.17 KB)
ðŸ“„ quopri.py(7.03 KB)
ðŸ“„ random.py(36.14 KB)
ðŸ“ re
ðŸ“„ reprlib.py(7.02 KB)
ðŸ“„ rlcompleter.py(7.73 KB)
ðŸ“„ runpy.py(12.58 KB)
ðŸ“„ sched.py(6.2 KB)
ðŸ“„ secrets.py(1.94 KB)
ðŸ“„ selectors.py(19 KB)
ðŸ“„ shelve.py(8.6 KB)
ðŸ“„ shlex.py(13.04 KB)
ðŸ“„ shutil.py(56.12 KB)
ðŸ“„ signal.py(2.44 KB)
ðŸ“ site-packages
ðŸ“„ site.py(24.79 KB)
ðŸ“„ smtplib.py(42.52 KB)
ðŸ“„ socket.py(36.87 KB)
ðŸ“„ socketserver.py(27.41 KB)
ðŸ“ sqlite3
ðŸ“„ sre_compile.py(231 B)
ðŸ“„ sre_constants.py(232 B)
ðŸ“„ sre_parse.py(229 B)
ðŸ“„ ssl.py(51.47 KB)
ðŸ“„ stat.py(6 KB)
ðŸ“„ statistics.py(60.38 KB)
ðŸ“„ string.py(11.51 KB)
ðŸ“„ stringprep.py(12.61 KB)
ðŸ“„ struct.py(257 B)
ðŸ“„ subprocess.py(87.15 KB)
ðŸ“„ symtable.py(13.87 KB)
ðŸ“ sysconfig
ðŸ“„ tabnanny.py(11.27 KB)
ðŸ“„ tarfile.py(107.5 KB)
ðŸ“„ tempfile.py(31.61 KB)
ðŸ“„ textwrap.py(19.47 KB)
ðŸ“„ this.py(1003 B)
ðŸ“„ threading.py(53.87 KB)
ðŸ“„ timeit.py(13.16 KB)
ðŸ“„ token.py(2.43 KB)
ðŸ“„ tokenize.py(21.06 KB)
ðŸ“ tomllib
ðŸ“„ trace.py(29.03 KB)
ðŸ“„ traceback.py(64.31 KB)
ðŸ“„ tracemalloc.py(17.62 KB)
ðŸ“„ tty.py(1.99 KB)
ðŸ“„ types.py(10.94 KB)
ðŸ“„ typing.py(129.61 KB)
ðŸ“ unittest
ðŸ“ urllib
ðŸ“„ uuid.py(28.46 KB)
ðŸ“ venv
ðŸ“„ warnings.py(26.32 KB)
ðŸ“„ wave.py(22.69 KB)
ðŸ“„ weakref.py(21.01 KB)
ðŸ“„ webbrowser.py(23.73 KB)
ðŸ“ wsgiref
ðŸ“ xml
ðŸ“ xmlrpc
ðŸ“„ zipapp.py(8.42 KB)
ðŸ“ zipfile
ðŸ“„ zipimport.py(32.12 KB)
ðŸ“ zoneinfo

Editing: _weakrefset.py

# Access WeakSet through the weakref module.
# This code is separated-out because it is needed
# by abc.py to load everything else at startup.

from _weakref import ref
from types import GenericAlias

__all__ = ['WeakSet']

class _IterationGuard:
    # This context manager registers itself in the current iterators of the
    # weak container, such as to delay all removals until the context manager
    # exits.
    # This technique should be relatively thread-safe (since sets are).

def __init__(self, weakcontainer):
        # Don't create cycles
        self.weakcontainer = ref(weakcontainer)

def __enter__(self):
        w = self.weakcontainer()
        if w is not None:
            w._iterating.add(self)
        return self

def __exit__(self, e, t, b):
        w = self.weakcontainer()
        if w is not None:
            s = w._iterating
            s.remove(self)
            if not s:
                w._commit_removals()

class WeakSet:
    def __init__(self, data=None):
        self.data = set()
        def _remove(item, selfref=ref(self)):
            self = selfref()
            if self is not None:
                if self._iterating:
                    self._pending_removals.append(item)
                else:
                    self.data.discard(item)
        self._remove = _remove
        # A list of keys to be removed
        self._pending_removals = []
        self._iterating = set()
        if data is not None:
            self.update(data)

def _commit_removals(self):
        pop = self._pending_removals.pop
        discard = self.data.discard
        while True:
            try:
                item = pop()
            except IndexError:
                return
            discard(item)

def __iter__(self):
        with _IterationGuard(self):
            for itemref in self.data:
                item = itemref()
                if item is not None:
                    # Caveat: the iterator will keep a strong reference to
                    # `item` until it is resumed or closed.
                    yield item

def __len__(self):
        return len(self.data) - len(self._pending_removals)

def __contains__(self, item):
        try:
            wr = ref(item)
        except TypeError:
            return False
        return wr in self.data

def __reduce__(self):
        return self.__class__, (list(self),), self.__getstate__()

def add(self, item):
        if self._pending_removals:
            self._commit_removals()
        self.data.add(ref(item, self._remove))

def clear(self):
        if self._pending_removals:
            self._commit_removals()
        self.data.clear()

def copy(self):
        return self.__class__(self)

def pop(self):
        if self._pending_removals:
            self._commit_removals()
        while True:
            try:
                itemref = self.data.pop()
            except KeyError:
                raise KeyError('pop from empty WeakSet') from None
            item = itemref()
            if item is not None:
                return item

def remove(self, item):
        if self._pending_removals:
            self._commit_removals()
        self.data.remove(ref(item))

def discard(self, item):
        if self._pending_removals:
            self._commit_removals()
        self.data.discard(ref(item))

def update(self, other):
        if self._pending_removals:
            self._commit_removals()
        for element in other:
            self.add(element)

def __ior__(self, other):
        self.update(other)
        return self

def difference(self, other):
        newset = self.copy()
        newset.difference_update(other)
        return newset
    __sub__ = difference

def difference_update(self, other):
        self.__isub__(other)
    def __isub__(self, other):
        if self._pending_removals:
            self._commit_removals()
        if self is other:
            self.data.clear()
        else:
            self.data.difference_update(ref(item) for item in other)
        return self

def intersection(self, other):
        return self.__class__(item for item in other if item in self)
    __and__ = intersection

def intersection_update(self, other):
        self.__iand__(other)
    def __iand__(self, other):
        if self._pending_removals:
            self._commit_removals()
        self.data.intersection_update(ref(item) for item in other)
        return self

def issubset(self, other):
        return self.data.issubset(ref(item) for item in other)
    __le__ = issubset

def __lt__(self, other):
        return self.data < set(map(ref, other))

def issuperset(self, other):
        return self.data.issuperset(ref(item) for item in other)
    __ge__ = issuperset

def __gt__(self, other):
        return self.data > set(map(ref, other))

def __eq__(self, other):
        if not isinstance(other, self.__class__):
            return NotImplemented
        return self.data == set(map(ref, other))

def symmetric_difference(self, other):
        newset = self.copy()
        newset.symmetric_difference_update(other)
        return newset
    __xor__ = symmetric_difference

def symmetric_difference_update(self, other):
        self.__ixor__(other)
    def __ixor__(self, other):
        if self._pending_removals:
            self._commit_removals()
        if self is other:
            self.data.clear()
        else:
            self.data.symmetric_difference_update(ref(item, self._remove) for item in other)
        return self

def union(self, other):
        return self.__class__(e for s in (self, other) for e in s)
    __or__ = union

def isdisjoint(self, other):
        return len(self.intersection(other)) == 0

def __repr__(self):
        return repr(self.data)

__class_getitem__ = classmethod(GenericAlias)

X7ROOT File Manager

Editing: _weakrefset.py

Upload File

Create Folder