PATH: //proc/thread-self/root/proc/thread-self/root/opt/alt/python311/lib64/python3.11
FILE_BARU
CREATE
FOLDER_BARU
MKDIR
UPLOAD_FILE
GO
[ .. KEMBALI ]
📄 LICENSE.txt
↓
X
📄 __future__.py
↓
X
📄 __hello__.py
↓
X
📁 __pycache__/
X
📄 _aix_support.py
↓
X
📄 _bootsubprocess.py
↓
X
📄 _collections_abc.py
↓
X
📄 _compat_pickle.py
↓
X
📄 _compression.py
↓
X
📄 _markupbase.py
↓
X
📄 _osx_support.py
↓
X
📄 _py_abc.py
↓
X
📄 _pydecimal.py
↓
X
📄 _pyio.py
↓
X
📄 _sitebuiltins.py
↓
X
📄 _strptime.py
↓
X
📄 _sysconfigdata__linux_x86_64-linux-gnu.py
↓
X
📄 _sysconfigdata_d_linux_x86_64-linux-gnu.py
↓
X
📄 _threading_local.py
↓
X
📄 _weakrefset.py
↓
X
📄 abc.py
↓
X
📄 aifc.py
↓
X
📄 antigravity.py
↓
X
📄 argparse.py
↓
X
📄 ast.py
↓
X
📄 asynchat.py
↓
X
📁 asyncio/
X
📄 asyncore.py
↓
X
📄 base64.py
↓
X
📄 bdb.py
↓
X
📄 bisect.py
↓
X
📄 bz2.py
↓
X
📄 cProfile.py
↓
X
📄 calendar.py
↓
X
📄 cgi.py
↓
X
📄 cgitb.py
↓
X
📄 chunk.py
↓
X
📄 cmd.py
↓
X
📄 code.py
↓
X
📄 codecs.py
↓
X
📄 codeop.py
↓
X
📁 collections/
X
📄 colorsys.py
↓
X
📄 compileall.py
↓
X
📁 concurrent/
X
📁 config-3.11-x86_64-linux-gnu/
X
📁 config-3.11d-x86_64-linux-gnu/
X
📄 configparser.py
↓
X
📄 contextlib.py
↓
X
📄 contextvars.py
↓
X
📄 copy.py
↓
X
📄 copyreg.py
↓
X
📄 crypt.py
↓
X
📄 csv.py
↓
X
📁 ctypes/
X
📁 curses/
X
📄 dataclasses.py
↓
X
📄 datetime.py
↓
X
📁 dbm/
X
📄 decimal.py
↓
X
📄 difflib.py
↓
X
📄 dis.py
↓
X
📁 distutils/
X
📄 doctest.py
↓
X
📁 email/
X
📁 encodings/
X
📁 ensurepip/
X
📄 enum.py
↓
X
📄 filecmp.py
↓
X
📄 fileinput.py
↓
X
📄 fnmatch.py
↓
X
📄 fractions.py
↓
X
📄 ftplib.py
↓
X
📄 functools.py
↓
X
📄 genericpath.py
↓
X
📄 getopt.py
↓
X
📄 getpass.py
↓
X
📄 gettext.py
↓
X
📄 glob.py
↓
X
📄 graphlib.py
↓
X
📄 gzip.py
↓
X
📄 hashlib.py
↓
X
📄 heapq.py
↓
X
📄 hmac.py
↓
X
📁 html/
X
📁 http/
X
📁 idlelib/
X
📄 imaplib.py
↓
X
📄 imghdr.py
↓
X
📄 imp.py
↓
X
📁 importlib/
X
📄 inspect.py
↓
X
📄 io.py
↓
X
📄 ipaddress.py
↓
X
📁 json/
X
📄 keyword.py
↓
X
📁 lib-dynload/
X
📁 lib2to3/
X
📄 linecache.py
↓
X
📄 locale.py
↓
X
📁 logging/
X
📄 lzma.py
↓
X
📄 mailbox.py
↓
X
📄 mailcap.py
↓
X
📄 mimetypes.py
↓
X
📄 modulefinder.py
↓
X
📁 multiprocessing/
X
📄 netrc.py
↓
X
📄 nntplib.py
↓
X
📄 ntpath.py
↓
X
📄 nturl2path.py
↓
X
📄 numbers.py
↓
X
📄 opcode.py
↓
X
📄 operator.py
↓
X
📄 optparse.py
↓
X
📄 os.py
↓
X
📄 pathlib.py
↓
X
📄 pdb.py
↓
X
📄 pickle.py
↓
X
📄 pickletools.py
↓
X
📄 pipes.py
↓
X
📄 pkgutil.py
↓
X
📄 platform.py
↓
X
📄 plistlib.py
↓
X
📄 poplib.py
↓
X
📄 posixpath.py
↓
X
📄 pprint.py
↓
X
📄 profile.py
↓
X
📄 pstats.py
↓
X
📄 pty.py
↓
X
📄 py_compile.py
↓
X
📄 pyclbr.py
↓
X
📄 pydoc.py
↓
X
📁 pydoc_data/
X
📄 queue.py
↓
X
📄 quopri.py
↓
X
📄 random.py
↓
X
📁 re/
X
📄 reprlib.py
↓
X
📄 rlcompleter.py
↓
X
📄 runpy.py
↓
X
📄 sched.py
↓
X
📄 secrets.py
↓
X
📄 selectors.py
↓
X
📄 shelve.py
↓
X
📄 shlex.py
↓
X
📄 shutil.py
↓
X
📄 signal.py
↓
X
📁 site-packages/
X
📄 site.py
↓
X
📄 smtpd.py
↓
X
📄 smtplib.py
↓
X
📄 sndhdr.py
↓
X
📄 socket.py
↓
X
📄 socketserver.py
↓
X
📁 sqlite3/
X
📄 sre_compile.py
↓
X
📄 sre_constants.py
↓
X
📄 sre_parse.py
↓
X
📄 ssl.py
↓
X
📄 stat.py
↓
X
📄 statistics.py
↓
X
📄 string.py
↓
X
📄 stringprep.py
↓
X
📄 struct.py
↓
X
📄 subprocess.py
↓
X
📄 sunau.py
↓
X
📄 symtable.py
↓
X
📄 sysconfig.py
↓
X
📄 tabnanny.py
↓
X
📄 tarfile.py
↓
X
📄 telnetlib.py
↓
X
📄 tempfile.py
↓
X
📁 test/
X
📄 textwrap.py
↓
X
📄 this.py
↓
X
📄 threading.py
↓
X
📄 timeit.py
↓
X
📁 tkinter/
X
📄 token.py
↓
X
📄 tokenize.py
↓
X
📁 tomllib/
X
📄 trace.py
↓
X
📄 traceback.py
↓
X
📄 tracemalloc.py
↓
X
📄 tty.py
↓
X
📄 turtle.py
↓
X
📁 turtledemo/
X
📄 types.py
↓
X
📄 typing.py
↓
X
📁 unittest/
X
📁 urllib/
X
📄 uu.py
↓
X
📄 uuid.py
↓
X
📁 venv/
X
📄 warnings.py
↓
X
📄 wave.py
↓
X
📄 weakref.py
↓
X
📄 webbrowser.py
↓
X
📁 wsgiref/
X
📄 xdrlib.py
↓
X
📁 xml/
X
📁 xmlrpc/
X
📄 zipapp.py
↓
X
📄 zipfile.py
↓
X
📄 zipimport.py
↓
X
📁 zoneinfo/
X
SAVING...
BERHASIL DIUBAH!
EDITING: bisect.py
"""Bisection algorithms.""" def insort_right(a, x, lo=0, hi=None, *, key=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 key is None: lo = bisect_right(a, x, lo, hi) else: lo = bisect_right(a, key(x), lo, hi, key=key) a.insert(lo, x) def bisect_right(a, x, lo=0, hi=None, *, key=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(i, 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) # Note, the comparison uses "<" to match the # __lt__() logic in list.sort() and in heapq. if key is None: while lo < hi: mid = (lo + hi) // 2 if x < a[mid]: hi = mid else: lo = mid + 1 else: while lo < hi: mid = (lo + hi) // 2 if x < key(a[mid]): hi = mid else: lo = mid + 1 return lo def insort_left(a, x, lo=0, hi=None, *, key=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 key is None: lo = bisect_left(a, x, lo, hi) else: lo = bisect_left(a, key(x), lo, hi, key=key) a.insert(lo, x) def bisect_left(a, x, lo=0, hi=None, *, key=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(i, 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) # Note, the comparison uses "<" to match the # __lt__() logic in list.sort() and in heapq. if key is None: while lo < hi: mid = (lo + hi) // 2 if a[mid] < x: lo = mid + 1 else: hi = mid else: while lo < hi: mid = (lo + hi) // 2 if key(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
SIMPAN PERUBAHAN