File Manager

X7ROOT File Manager

Current Path: /lib64/python3.8

lib64 / python3.8 /

?? ..
?? LICENSE.txt(13.61 KB)
?? __future__.py(5.03 KB)
?? __phello__.foo.py(64 B)
?? __pycache__
?? _bootlocale.py(1.76 KB)
?? _collections_abc.py(25.49 KB)
?? _compat_pickle.py(8.54 KB)
?? _compression.py(5.21 KB)
?? _dummy_thread.py(5.89 KB)
?? _markupbase.py(14.26 KB)
?? _osx_support.py(21.26 KB)
?? _py_abc.py(6.04 KB)
?? _pydecimal.py(223.31 KB)
?? _pyio.py(90.99 KB)
?? _sitebuiltins.py(3.04 KB)
?? _strptime.py(24.68 KB)
?? _sysconfigdata__linux_x86_64-linux-gnu.py(37.61 KB)
?? _sysconfigdata_d_linux_x86_64-linux-gnu.py(37.34 KB)
?? _threading_local.py(7.05 KB)
?? _weakrefset.py(5.6 KB)
?? abc.py(4.38 KB)
?? aifc.py(32.04 KB)
?? antigravity.py(477 B)
?? argparse.py(93.76 KB)
?? ast.py(18.78 KB)
?? asynchat.py(11.06 KB)
?? asyncio
?? asyncore.py(19.62 KB)
?? base64.py(19.9 KB)
?? bdb.py(31.3 KB)
?? binhex.py(13.63 KB)
?? bisect.py(2.16 KB)
?? bz2.py(12.26 KB)
?? cProfile.py(6.85 KB)
?? calendar.py(24.25 KB)
?? cgi.py(33.14 KB)
?? cgitb.py(11.81 KB)
?? chunk.py(5.31 KB)
?? cmd.py(14.51 KB)
?? code.py(10.37 KB)
?? codecs.py(35.81 KB)
?? codeop.py(6.18 KB)
?? collections
?? colorsys.py(3.97 KB)
?? compileall.py(13.36 KB)
?? concurrent
?? config-3.8-x86_64-linux-gnu
?? configparser.py(53.1 KB)
?? contextlib.py(24.41 KB)
?? contextvars.py(129 B)
?? copy.py(8.46 KB)
?? copyreg.py(6.97 KB)
?? crypt.py(3.53 KB)
?? csv.py(15.77 KB)
?? ctypes
?? curses
?? dataclasses.py(48.8 KB)
?? datetime.py(86.22 KB)
?? dbm
?? decimal.py(320 B)
?? difflib.py(82.09 KB)
?? dis.py(20.09 KB)
?? distutils
?? doctest.py(102.09 KB)
?? dummy_threading.py(2.75 KB)
?? email
?? encodings
?? ensurepip
?? enum.py(37.24 KB)
?? filecmp.py(9.6 KB)
?? fileinput.py(14.36 KB)
?? fnmatch.py(3.98 KB)
?? formatter.py(14.79 KB)
?? fractions.py(23.76 KB)
?? ftplib.py(34.31 KB)
?? functools.py(36.53 KB)
?? genericpath.py(4.86 KB)
?? getopt.py(7.31 KB)
?? getpass.py(5.85 KB)
?? gettext.py(26.5 KB)
?? glob.py(5.56 KB)
?? gzip.py(20.91 KB)
?? hashlib.py(8.14 KB)
?? heapq.py(22.34 KB)
?? hmac.py(7.67 KB)
?? html
?? http
?? imaplib.py(52.35 KB)
?? imghdr.py(3.72 KB)
?? imp.py(10.29 KB)
?? importlib
?? inspect.py(115.77 KB)
?? io.py(3.46 KB)
?? ipaddress.py(69.96 KB)
?? json
?? keyword.py(945 B)
?? lib-dynload
?? lib2to3
?? linecache.py(5.21 KB)
?? locale.py(76.36 KB)
?? logging
?? lzma.py(12.68 KB)
?? mailbox.py(76.82 KB)
?? mailcap.py(8.85 KB)
?? mimetypes.py(21.16 KB)
?? modulefinder.py(23.86 KB)
?? multiprocessing
?? netrc.py(5.44 KB)
?? nntplib.py(42.25 KB)
?? ntpath.py(27.08 KB)
?? nturl2path.py(2.82 KB)
?? numbers.py(10 KB)
?? opcode.py(5.67 KB)
?? operator.py(10.46 KB)
?? optparse.py(58.95 KB)
?? os.py(38.08 KB)
?? pathlib.py(51.38 KB)
?? pdb.py(61.27 KB)
?? pickle.py(62.96 KB)
?? pickletools.py(91.29 KB)
?? pipes.py(8.71 KB)
?? pkgutil.py(21 KB)
?? platform.py(39.48 KB)
?? plistlib.py(31.46 KB)
?? poplib.py(14.72 KB)
?? posixpath.py(15.26 KB)
?? pprint.py(20.98 KB)
?? profile.py(22.99 KB)
?? pstats.py(26.7 KB)
?? pty.py(4.69 KB)
?? py_compile.py(8.01 KB)
?? pyclbr.py(14.9 KB)
?? pydoc.py(104.2 KB)
?? pydoc_data
?? queue.py(11.09 KB)
?? quopri.py(7.08 KB)
?? random.py(28.13 KB)
?? re.py(15.49 KB)
?? reprlib.py(5.14 KB)
?? rlcompleter.py(6.93 KB)
?? runpy.py(11.77 KB)
?? sched.py(6.29 KB)
?? secrets.py(1.99 KB)
?? selectors.py(18.13 KB)
?? shelve.py(8.33 KB)
?? shlex.py(13.01 KB)
?? shutil.py(50.55 KB)
?? signal.py(2.22 KB)
?? site-packages
?? site.py(21.33 KB)
?? smtpd.py(33.9 KB)
?? smtplib.py(43.95 KB)
?? sndhdr.py(6.93 KB)
?? socket.py(34.42 KB)
?? socketserver.py(26.66 KB)
?? sqlite3
?? sre_compile.py(26.07 KB)
?? sre_constants.py(6.99 KB)
?? sre_parse.py(39.29 KB)
?? ssl.py(49.57 KB)
?? stat.py(5.36 KB)
?? statistics.py(38.76 KB)
?? string.py(10.29 KB)
?? stringprep.py(12.61 KB)
?? struct.py(257 B)
?? subprocess.py(76.42 KB)
?? sunau.py(17.94 KB)
?? symbol.py(2.06 KB)
?? symtable.py(7.83 KB)
?? sysconfig.py(24.31 KB)
?? tabnanny.py(11.14 KB)
?? tarfile.py(103.98 KB)
?? telnetlib.py(22.71 KB)
?? tempfile.py(26.89 KB)
?? textwrap.py(18.95 KB)
?? this.py(1003 B)
?? threading.py(49.63 KB)
?? timeit.py(13.16 KB)
?? tkinter
?? token.py(2.31 KB)
?? tokenize.py(25.24 KB)
?? trace.py(29.17 KB)
?? traceback.py(23.06 KB)
?? tracemalloc.py(16.68 KB)
?? tty.py(879 B)
?? turtle.py(140.35 KB)
?? turtledemo
?? types.py(9.49 KB)
?? typing.py(67.35 KB)
?? unittest
?? urllib
?? uu.py(7.11 KB)
?? uuid.py(29.8 KB)
?? venv
?? warnings.py(19.23 KB)
?? wave.py(17.8 KB)
?? weakref.py(20.89 KB)
?? webbrowser.py(23.52 KB)
?? wsgiref
?? xdrlib.py(5.77 KB)
?? xml
?? xmlrpc
?? zipapp.py(7.36 KB)
?? zipfile.py(85.67 KB)
?? zipimport.py(30.04 KB)

Editing: bisect.py

"""Bisection algorithms."""

def insort_right(a, x, lo=0, hi=None):
    """Insert item x in list a, and keep it sorted assuming a is sorted.

If x is already in a, insert it to the right of the rightmost x.

Optional args lo (default 0) and hi (default len(a)) bound the
    slice of a to be searched.
    """

lo = bisect_right(a, x, lo, hi)
    a.insert(lo, x)

def bisect_right(a, x, lo=0, hi=None):
    """Return the index where to insert item x in list a, assuming a is sorted.

The return value i is such that all e in a[:i] have e <= x, and all e in
    a[i:] have e > x.  So if x already appears in the list, a.insert(x) will
    insert just after the rightmost x already there.

Optional args lo (default 0) and hi (default len(a)) bound the
    slice of a to be searched.
    """

if lo < 0:
        raise ValueError('lo must be non-negative')
    if hi is None:
        hi = len(a)
    while lo < hi:
        mid = (lo+hi)//2
        if x < a[mid]: hi = mid
        else: lo = mid+1
    return lo

def insort_left(a, x, lo=0, hi=None):
    """Insert item x in list a, and keep it sorted assuming a is sorted.

If x is already in a, insert it to the left of the leftmost x.

Optional args lo (default 0) and hi (default len(a)) bound the
    slice of a to be searched.
    """

lo = bisect_left(a, x, lo, hi)
    a.insert(lo, x)

def bisect_left(a, x, lo=0, hi=None):
    """Return the index where to insert item x in list a, assuming a is sorted.

The return value i is such that all e in a[:i] have e < x, and all e in
    a[i:] have e >= x.  So if x already appears in the list, a.insert(x) will
    insert just before the leftmost x already there.

Optional args lo (default 0) and hi (default len(a)) bound the
    slice of a to be searched.
    """

if lo < 0:
        raise ValueError('lo must be non-negative')
    if hi is None:
        hi = len(a)
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] < x: lo = mid+1
        else: hi = mid
    return lo

# Overwrite above definitions with a fast C implementation
try:
    from _bisect import *
except ImportError:
    pass

# Create aliases
bisect = bisect_right
insort = insort_right

X7ROOT File Manager

Editing: bisect.py

Upload File

Create Folder