SM0 She11

Path: / / usr / lib64 / python3.6

Full Path (server): /usr/lib64/python3.6

📄 __future__.py [E] [D]
📄 __phello__.foo.py [E] [D]
📁 __pycache__ Open [D]
📄 _bootlocale.py [E] [D]
📄 _collections_abc.py [E] [D]
📄 _compat_pickle.py [E] [D]
📄 _compression.py [E] [D]
📄 _dummy_thread.py [E] [D]
📄 _markupbase.py [E] [D]
📄 _osx_support.py [E] [D]
📄 _pydecimal.py [E] [D]
📄 _pyio.py [E] [D]
📄 _sitebuiltins.py [E] [D]
📄 _strptime.py [E] [D]
📄 _sysconfigdata_dm_linux_x86_64-linux-gnu.py [E] [D]
📄 _sysconfigdata_m_linux_x86_64-linux-gnu.py [E] [D]
📄 _threading_local.py [E] [D]
📄 _weakrefset.py [E] [D]
📄 abc.py [E] [D]
📄 aifc.py [E] [D]
📄 antigravity.py [E] [D]
📄 argparse.py [E] [D]
📄 ast.py [E] [D]
📄 asynchat.py [E] [D]
📁 asyncio Open [D]
📄 asyncore.py [E] [D]
📄 base64.py [E] [D]
📄 bdb.py [E] [D]
📄 binhex.py [E] [D]
📄 bisect.py [E] [D]
📄 bz2.py [E] [D]
📄 cProfile.py [E] [D]
📄 calendar.py [E] [D]
📄 cgi.py [E] [D]
📄 cgitb.py [E] [D]
📄 chunk.py [E] [D]
📄 cmd.py [E] [D]
📄 code.py [E] [D]
📄 codecs.py [E] [D]
📄 codeop.py [E] [D]
📁 collections Open [D]
📄 colorsys.py [E] [D]
📄 compileall.py [E] [D]
📁 concurrent Open [D]
📁 config-3.6m-x86_64-linux-gnu Open [D]
📄 configparser.py [E] [D]
📄 contextlib.py [E] [D]
📄 copy.py [E] [D]
📄 copyreg.py [E] [D]
📄 crypt.py [E] [D]
📄 csv.py [E] [D]
📁 ctypes Open [D]
📁 curses Open [D]
📄 datetime.py [E] [D]
📁 dbm Open [D]
📄 decimal.py [E] [D]
📄 difflib.py [E] [D]
📄 dis.py [E] [D]
📁 distutils Open [D]
📄 doctest.py [E] [D]
📄 dummy_threading.py [E] [D]
📁 email Open [D]
📁 encodings Open [D]
📁 ensurepip Open [D]
📄 enum.py [E] [D]
📄 filecmp.py [E] [D]
📄 fileinput.py [E] [D]
📄 fnmatch.py [E] [D]
📄 formatter.py [E] [D]
📄 fractions.py [E] [D]
📄 ftplib.py [E] [D]
📄 functools.py [E] [D]
📄 genericpath.py [E] [D]
📄 getopt.py [E] [D]
📄 getpass.py [E] [D]
📄 gettext.py [E] [D]
📄 glob.py [E] [D]
📄 gzip.py [E] [D]
📄 hashlib.py [E] [D]
📄 heapq.py [E] [D]
📄 hmac.py [E] [D]
📁 html Open [D]
📁 http Open [D]
📄 imaplib.py [E] [D]
📄 imghdr.py [E] [D]
📄 imp.py [E] [D]
📁 importlib Open [D]
📄 inspect.py [E] [D]
📄 io.py [E] [D]
📄 ipaddress.py [E] [D]
📁 json Open [D]
📄 keyword.py [E] [D]
📁 lib-dynload Open [D]
📁 lib2to3 Open [D]
📄 linecache.py [E] [D]
📄 locale.py [E] [D]
📁 logging Open [D]
📄 lzma.py [E] [D]
📄 macpath.py [E] [D]
📄 macurl2path.py [E] [D]
📄 mailbox.py [E] [D]
📄 mailcap.py [E] [D]
📄 mimetypes.py [E] [D]
📄 modulefinder.py [E] [D]
📁 multiprocessing Open [D]
📄 netrc.py [E] [D]
📄 nntplib.py [E] [D]
📄 ntpath.py [E] [D]
📄 nturl2path.py [E] [D]
📄 numbers.py [E] [D]
📄 opcode.py [E] [D]
📄 operator.py [E] [D]
📄 optparse.py [E] [D]
📄 os.py [E] [D]
📄 pathlib.py [E] [D]
📄 pdb.py [E] [D]
📄 pickle.py [E] [D]
📄 pickletools.py [E] [D]
📄 pipes.py [E] [D]
📄 pkgutil.py [E] [D]
📄 platform.py [E] [D]
📄 plistlib.py [E] [D]
📄 poplib.py [E] [D]
📄 posixpath.py [E] [D]
📄 pprint.py [E] [D]
📄 profile.py [E] [D]
📄 pstats.py [E] [D]
📄 pty.py [E] [D]
📄 py_compile.py [E] [D]
📄 pyclbr.py [E] [D]
📄 pydoc.py [E] [D]
📁 pydoc_data Open [D]
📄 queue.py [E] [D]
📄 quopri.py [E] [D]
📄 random.py [E] [D]
📄 re.py [E] [D]
📄 reprlib.py [E] [D]
📄 rlcompleter.py [E] [D]
📄 runpy.py [E] [D]
📄 sched.py [E] [D]
📄 secrets.py [E] [D]
📄 selectors.py [E] [D]
📄 shelve.py [E] [D]
📄 shlex.py [E] [D]
📄 shutil.py [E] [D]
📄 signal.py [E] [D]
📁 site-packages Open [D]
📄 site.py [E] [D]
📄 smtpd.py [E] [D]
📄 smtplib.py [E] [D]
📄 sndhdr.py [E] [D]
📄 socket.py [E] [D]
📄 socketserver.py [E] [D]
📁 sqlite3 Open [D]
📄 sre_compile.py [E] [D]
📄 sre_constants.py [E] [D]
📄 sre_parse.py [E] [D]
📄 ssl.py [E] [D]
📄 stat.py [E] [D]
📄 statistics.py [E] [D]
📄 string.py [E] [D]
📄 stringprep.py [E] [D]
📄 struct.py [E] [D]
📄 subprocess.py [E] [D]
📄 sunau.py [E] [D]
📄 symbol.py [E] [D]
📄 symtable.py [E] [D]
📄 sysconfig.py [E] [D]
📄 tabnanny.py [E] [D]
📄 tarfile.py [E] [D]
📄 telnetlib.py [E] [D]
📄 tempfile.py [E] [D]
📁 test Open [D]
📄 textwrap.py [E] [D]
📄 this.py [E] [D]
📄 threading.py [E] [D]
📄 timeit.py [E] [D]
📄 token.py [E] [D]
📄 tokenize.py [E] [D]
📄 trace.py [E] [D]
📄 traceback.py [E] [D]
📄 tracemalloc.py [E] [D]
📄 tty.py [E] [D]
📄 types.py [E] [D]
📄 typing.py [E] [D]
📁 unittest Open [D]
📁 urllib Open [D]
📄 uu.py [E] [D]
📄 uuid.py [E] [D]
📁 venv Open [D]
📄 warnings.py [E] [D]
📄 wave.py [E] [D]
📄 weakref.py [E] [D]
📄 webbrowser.py [E] [D]
📁 wsgiref Open [D]
📄 xdrlib.py [E] [D]
📁 xml Open [D]
📁 xmlrpc Open [D]
📄 zipapp.py [E] [D]
📄 zipfile.py [E] [D]

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