File Manager

X7ROOT File Manager

Current Path: /opt/alt/python35/lib64/python3.5

opt / alt / python35 / lib64 / python3.5 /

ðŸ“ ..
ðŸ“„ __future__.py(4.73 KB)
ðŸ“„ __phello__.foo.py(64 B)
ðŸ“ __pycache__
ðŸ“„ _bootlocale.py(1.27 KB)
ðŸ“„ _collections_abc.py(24.21 KB)
ðŸ“„ _compat_pickle.py(8.36 KB)
ðŸ“„ _compression.py(5.21 KB)
ðŸ“„ _dummy_thread.py(5 KB)
ðŸ“„ _markupbase.py(14.26 KB)
ðŸ“„ _osx_support.py(18.67 KB)
ðŸ“„ _pydecimal.py(223.27 KB)
ðŸ“„ _pyio.py(85.91 KB)
ðŸ“„ _sitebuiltins.py(3.04 KB)
ðŸ“„ _strptime.py(21.67 KB)
ðŸ“„ _sysconfigdata.py(26.32 KB)
ðŸ“„ _threading_local.py(7.24 KB)
ðŸ“„ _weakrefset.py(5.57 KB)
ðŸ“„ abc.py(8.43 KB)
ðŸ“„ aifc.py(31.22 KB)
ðŸ“„ antigravity.py(476 B)
ðŸ“„ argparse.py(88.03 KB)
ðŸ“„ ast.py(11.72 KB)
ðŸ“„ asynchat.py(11.69 KB)
ðŸ“ asyncio
ðŸ“„ asyncore.py(19.63 KB)
ðŸ“„ base64.py(20.04 KB)
ðŸ“„ bdb.py(22.81 KB)
ðŸ“„ binhex.py(13.63 KB)
ðŸ“„ bisect.py(2.53 KB)
ðŸ“„ bz2.py(12.13 KB)
ðŸ“„ cProfile.py(5.2 KB)
ðŸ“„ calendar.py(22.46 KB)
ðŸ“„ cgi.py(35.2 KB)
ðŸ“„ cgitb.py(11.74 KB)
ðŸ“„ chunk.py(5.3 KB)
ðŸ“„ cmd.py(14.51 KB)
ðŸ“„ code.py(9.88 KB)
ðŸ“„ codecs.py(35.38 KB)
ðŸ“„ codeop.py(5.85 KB)
ðŸ“ collections
ðŸ“„ colorsys.py(3.97 KB)
ðŸ“„ compileall.py(11.44 KB)
ðŸ“ concurrent
ðŸ“ config-3.5m
ðŸ“„ configparser.py(52.2 KB)
ðŸ“„ contextlib.py(12.16 KB)
ðŸ“„ copy.py(8.74 KB)
ðŸ“„ copyreg.py(6.67 KB)
ðŸ“„ crypt.py(1.83 KB)
ðŸ“„ csv.py(15.75 KB)
ðŸ“ ctypes
ðŸ“ curses
ðŸ“„ datetime.py(74.12 KB)
ðŸ“ dbm
ðŸ“„ decimal.py(320 B)
ðŸ“„ difflib.py(82.23 KB)
ðŸ“„ dis.py(16.94 KB)
ðŸ“ distutils
ðŸ“„ doctest.py(101.6 KB)
ðŸ“„ dummy_threading.py(2.75 KB)
ðŸ“ email
ðŸ“ encodings
ðŸ“ ensurepip
ðŸ“„ enum.py(21.71 KB)
ðŸ“„ filecmp.py(9.6 KB)
ðŸ“„ fileinput.py(13.92 KB)
ðŸ“„ fnmatch.py(3.09 KB)
ðŸ“„ formatter.py(14.79 KB)
ðŸ“„ fractions.py(24.04 KB)
ðŸ“„ ftplib.py(34.13 KB)
ðŸ“„ functools.py(28.27 KB)
ðŸ“„ genericpath.py(4.26 KB)
ðŸ“„ getopt.py(7.31 KB)
ðŸ“„ getpass.py(5.85 KB)
ðŸ“„ gettext.py(21.03 KB)
ðŸ“„ glob.py(4.95 KB)
ðŸ“„ gzip.py(19.79 KB)
ðŸ“„ hashlib.py(7.79 KB)
ðŸ“„ heapq.py(22.39 KB)
ðŸ“„ hmac.py(4.94 KB)
ðŸ“ html
ðŸ“ http
ðŸ“ idlelib
ðŸ“„ imaplib.py(50.96 KB)
ðŸ“„ imghdr.py(3.67 KB)
ðŸ“„ imp.py(10.43 KB)
ðŸ“ importlib
ðŸ“„ inspect.py(111.52 KB)
ðŸ“„ io.py(3.32 KB)
ðŸ“„ ipaddress.py(73.96 KB)
ðŸ“ json
ðŸ“„ keyword.py(2.17 KB)
ðŸ“ lib-dynload
ðŸ“ lib2to3
ðŸ“„ linecache.py(5.19 KB)
ðŸ“„ locale.py(72.96 KB)
ðŸ“ logging
ðŸ“„ lzma.py(12.62 KB)
ðŸ“„ macpath.py(5.77 KB)
ðŸ“„ macurl2path.py(2.67 KB)
ðŸ“„ mailbox.py(76.58 KB)
ðŸ“„ mailcap.py(7.91 KB)
ðŸ“„ mimetypes.py(20.36 KB)
ðŸ“„ modulefinder.py(22.54 KB)
ðŸ“ multiprocessing
ðŸ“„ netrc.py(5.61 KB)
ðŸ“„ nntplib.py(42.07 KB)
ðŸ“„ ntpath.py(22.26 KB)
ðŸ“„ nturl2path.py(2.39 KB)
ðŸ“„ numbers.py(10 KB)
ðŸ“„ opcode.py(5.75 KB)
ðŸ“„ operator.py(10.61 KB)
ðŸ“„ optparse.py(58.93 KB)
ðŸ“„ os.py(36.17 KB)
ðŸ“„ pathlib.py(45.9 KB)
ðŸ“„ pdb.py(59.72 KB)
ðŸ“„ pickle.py(54.86 KB)
ðŸ“„ pickletools.py(89.61 KB)
ðŸ“„ pipes.py(8.71 KB)
ðŸ“„ pkgutil.py(20.85 KB)
ðŸ“ plat-linux
ðŸ“„ platform.py(45.07 KB)
ðŸ“„ plistlib.py(31.06 KB)
ðŸ“„ poplib.py(14.37 KB)
ðŸ“„ posixpath.py(14.56 KB)
ðŸ“„ pprint.py(20.37 KB)
ðŸ“„ profile.py(21.52 KB)
ðŸ“„ pstats.py(25.94 KB)
ðŸ“„ pty.py(4.65 KB)
ðŸ“„ py_compile.py(7.01 KB)
ðŸ“„ pyclbr.py(13.25 KB)
ðŸ“„ pydoc.py(101.22 KB)
ðŸ“ pydoc_data
ðŸ“„ queue.py(8.57 KB)
ðŸ“„ quopri.py(7.09 KB)
ðŸ“„ random.py(25.84 KB)
ðŸ“„ re.py(15.14 KB)
ðŸ“„ reprlib.py(5.21 KB)
ðŸ“„ rlcompleter.py(6.16 KB)
ðŸ“„ runpy.py(11.68 KB)
ðŸ“„ sched.py(6.07 KB)
ðŸ“„ selectors.py(18.98 KB)
ðŸ“„ shelve.py(8.33 KB)
ðŸ“„ shlex.py(11.18 KB)
ðŸ“„ shutil.py(39.11 KB)
ðŸ“„ signal.py(2.07 KB)
ðŸ“ site-packages
ðŸ“„ site.py(21 KB)
ðŸ“„ smtpd.py(34.54 KB)
ðŸ“„ smtplib.py(42.61 KB)
ðŸ“„ sndhdr.py(6.27 KB)
ðŸ“„ socket.py(26.5 KB)
ðŸ“„ socketserver.py(24.09 KB)
ðŸ“ sqlite3
ðŸ“„ sre_compile.py(17.98 KB)
ðŸ“„ sre_constants.py(6.66 KB)
ðŸ“„ sre_parse.py(34.29 KB)
ðŸ“„ ssl.py(41.36 KB)
ðŸ“„ stat.py(4.92 KB)
ðŸ“„ statistics.py(19.08 KB)
ðŸ“„ string.py(11.58 KB)
ðŸ“„ stringprep.py(12.61 KB)
ðŸ“„ struct.py(257 B)
ðŸ“„ subprocess.py(57.53 KB)
ðŸ“„ sunau.py(17.67 KB)
ðŸ“„ symbol.py(2.06 KB)
ðŸ“„ symtable.py(7.02 KB)
ðŸ“„ sysconfig.py(23.89 KB)
ðŸ“„ tabnanny.py(11.15 KB)
ðŸ“„ tarfile.py(90.89 KB)
ðŸ“„ telnetlib.py(22.48 KB)
ðŸ“„ tempfile.py(26.01 KB)
ðŸ“ test
ðŸ“„ textwrap.py(19.1 KB)
ðŸ“„ this.py(1003 B)
ðŸ“„ threading.py(47.88 KB)
ðŸ“„ timeit.py(12.11 KB)
ðŸ“„ token.py(3 KB)
ðŸ“„ tokenize.py(27.14 KB)
ðŸ“„ trace.py(30.81 KB)
ðŸ“„ traceback.py(21.66 KB)
ðŸ“„ tracemalloc.py(15.27 KB)
ðŸ“„ tty.py(879 B)
ðŸ“„ types.py(8.59 KB)
ðŸ“„ typing.py(78.26 KB)
ðŸ“ unittest
ðŸ“ urllib
ðŸ“„ uu.py(6.61 KB)
ðŸ“„ uuid.py(22.72 KB)
ðŸ“ venv
ðŸ“„ warnings.py(15.48 KB)
ðŸ“„ wave.py(17.27 KB)
ðŸ“„ weakref.py(19.99 KB)
ðŸ“„ webbrowser.py(21.32 KB)
ðŸ“ wsgiref
ðŸ“„ xdrlib.py(5.77 KB)
ðŸ“ xml
ðŸ“ xmlrpc
ðŸ“„ zipapp.py(6.99 KB)
ðŸ“„ zipfile.py(71.95 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.
    """

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
    a.insert(lo, x)

insort = insort_right   # backward compatibility

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

bisect = bisect_right   # backward compatibility

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.
    """

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
    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

X7ROOT File Manager

Editing: bisect.py

Upload File

Create Folder