Gecko [ sachasauda.akalacademy.ac.in ]

/ usr / lib64 / python3.6 / [ HOME SHELL ]

Name	Size	Permission	Action
__pycache__	[ DIR ]	drwxr-xr-x
asyncio	[ DIR ]	drwxr-xr-x
collections	[ DIR ]	drwxr-xr-x
concurrent	[ DIR ]	drwxr-xr-x
config-3.6m-x86_64-linux-gnu	[ DIR ]	drwxr-xr-x
ctypes	[ DIR ]	drwxr-xr-x
curses	[ DIR ]	drwxr-xr-x
dbm	[ DIR ]	drwxr-xr-x
distutils	[ DIR ]	drwxr-xr-x
email	[ DIR ]	drwxr-xr-x
encodings	[ DIR ]	drwxr-xr-x
ensurepip	[ DIR ]	drwxr-xr-x
html	[ DIR ]	drwxr-xr-x
http	[ DIR ]	drwxr-xr-x
importlib	[ DIR ]	drwxr-xr-x
json	[ DIR ]	drwxr-xr-x
lib-dynload	[ DIR ]	drwxr-xr-x
lib2to3	[ DIR ]	drwxr-xr-x
logging	[ DIR ]	drwxr-xr-x
multiprocessing	[ DIR ]	drwxr-xr-x
pydoc_data	[ DIR ]	drwxr-xr-x
site-packages	[ DIR ]	drwxr-xr-x
sqlite3	[ DIR ]	drwxr-xr-x
test	[ DIR ]	drwxr-xr-x
unittest	[ DIR ]	drwxr-xr-x
urllib	[ DIR ]	drwxr-xr-x
venv	[ DIR ]	drwxr-xr-x
wsgiref	[ DIR ]	drwxr-xr-x
xml	[ DIR ]	drwxr-xr-x
xmlrpc	[ DIR ]	drwxr-xr-x
__future__.py	4.73 KB	-rw-r--r--
__phello__.foo.py	64 B	-rw-r--r--
_bootlocale.py	1.27 KB	-rw-r--r--
_collections_abc.py	25.77 KB	-rw-r--r--
_compat_pickle.py	8.54 KB	-rw-r--r--
_compression.py	5.21 KB	-rw-r--r--
_dummy_thread.py	5 KB	-rw-r--r--
_markupbase.py	14.26 KB	-rw-r--r--
_osx_support.py	18.69 KB	-rw-r--r--
_pydecimal.py	224.83 KB	-rw-r--r--
_pyio.py	86.03 KB	-rw-r--r--
_sitebuiltins.py	3.04 KB	-rw-r--r--
_strptime.py	24.17 KB	-rw-r--r--
_sysconfigdata_dm_linux_x86_64...	22.13 KB	-rw-r--r--
_sysconfigdata_m_linux_x86_64-...	21.54 KB	-rw-r--r--
_threading_local.py	7.04 KB	-rw-r--r--
_weakrefset.py	5.57 KB	-rw-r--r--
abc.py	8.52 KB	-rw-r--r--
aifc.py	31.69 KB	-rw-r--r--
antigravity.py	477 B	-rw-r--r--
argparse.py	88.25 KB	-rw-r--r--
ast.py	11.88 KB	-rw-r--r--
asynchat.py	11.06 KB	-rw-r--r--
asyncore.py	19.69 KB	-rw-r--r--
base64.py	19.9 KB	-rwxr-xr-x
bdb.py	23 KB	-rw-r--r--
binhex.py	13.63 KB	-rw-r--r--
bisect.py	2.53 KB	-rw-r--r--
bz2.py	12.19 KB	-rw-r--r--
cProfile.py	5.24 KB	-rwxr-xr-x
calendar.py	22.67 KB	-rw-r--r--
cgi.py	35.93 KB	-rwxr-xr-x
cgitb.py	11.74 KB	-rw-r--r--
chunk.py	5.3 KB	-rw-r--r--
cmd.py	14.51 KB	-rw-r--r--
code.py	10.37 KB	-rw-r--r--
codecs.py	35.43 KB	-rw-r--r--
codeop.py	5.85 KB	-rw-r--r--
colorsys.py	3.97 KB	-rw-r--r--
compileall.py	11.84 KB	-rw-r--r--
configparser.py	52.34 KB	-rw-r--r--
contextlib.py	12.85 KB	-rw-r--r--
copy.py	8.61 KB	-rw-r--r--
copyreg.py	6.84 KB	-rw-r--r--
crypt.py	1.82 KB	-rw-r--r--
csv.py	15.8 KB	-rw-r--r--
datetime.py	80.11 KB	-rw-r--r--
decimal.py	320 B	-rw-r--r--
difflib.py	82.4 KB	-rw-r--r--
dis.py	17.71 KB	-rw-r--r--
doctest.py	101.94 KB	-rw-r--r--
dummy_threading.py	2.75 KB	-rw-r--r--
enum.py	32.82 KB	-rw-r--r--
filecmp.py	9.6 KB	-rw-r--r--
fileinput.py	14.13 KB	-rw-r--r--
fnmatch.py	3.09 KB	-rw-r--r--
formatter.py	14.79 KB	-rw-r--r--
fractions.py	23.08 KB	-rw-r--r--
ftplib.py	34.43 KB	-rw-r--r--
functools.py	30.61 KB	-rw-r--r--
genericpath.py	4.64 KB	-rw-r--r--
getopt.py	7.31 KB	-rw-r--r--
getpass.py	5.85 KB	-rw-r--r--
gettext.py	21.03 KB	-rw-r--r--
glob.py	5.51 KB	-rw-r--r--
gzip.py	19.86 KB	-rw-r--r--
hashlib.py	8.52 KB	-rw-r--r--
heapq.py	22.39 KB	-rw-r--r--
hmac.py	6.23 KB	-rw-r--r--
imaplib.py	52.05 KB	-rw-r--r--
imghdr.py	3.71 KB	-rw-r--r--
imp.py	10.42 KB	-rw-r--r--
inspect.py	114.22 KB	-rw-r--r--
io.py	3.43 KB	-rw-r--r--
ipaddress.py	72.82 KB	-rw-r--r--
keyword.py	2.16 KB	-rwxr-xr-x
linecache.py	5.19 KB	-rw-r--r--
locale.py	75.49 KB	-rw-r--r--
lzma.py	12.68 KB	-rw-r--r--
macpath.py	5.83 KB	-rw-r--r--
macurl2path.py	2.67 KB	-rw-r--r--
mailbox.py	76.78 KB	-rw-r--r--
mailcap.py	7.91 KB	-rw-r--r--
mimetypes.py	20.55 KB	-rw-r--r--
modulefinder.py	22.49 KB	-rw-r--r--
netrc.py	5.55 KB	-rw-r--r--
nntplib.py	42.07 KB	-rw-r--r--
ntpath.py	22.55 KB	-rw-r--r--
nturl2path.py	2.39 KB	-rw-r--r--
numbers.py	10 KB	-rw-r--r--
opcode.py	5.69 KB	-rw-r--r--
operator.py	10.61 KB	-rw-r--r--
optparse.py	58.96 KB	-rw-r--r--
os.py	36.65 KB	-rw-r--r--
pathlib.py	47.83 KB	-rw-r--r--
pdb.py	59.87 KB	-rwxr-xr-x
pickle.py	54.39 KB	-rw-r--r--
pickletools.py	89.62 KB	-rw-r--r--
pipes.py	8.71 KB	-rw-r--r--
pkgutil.py	20.82 KB	-rw-r--r--
platform.py	46.08 KB	-rwxr-xr-x
plistlib.py	32.02 KB	-rw-r--r--
poplib.py	14.61 KB	-rw-r--r--
posixpath.py	15.4 KB	-rw-r--r--
pprint.py	20.37 KB	-rw-r--r--
profile.py	21.5 KB	-rwxr-xr-x
pstats.py	25.94 KB	-rw-r--r--
pty.py	4.65 KB	-rw-r--r--
py_compile.py	7.01 KB	-rw-r--r--
pyclbr.py	13.24 KB	-rw-r--r--
pydoc.py	101.8 KB	-rw-r--r--
queue.py	8.57 KB	-rw-r--r--
quopri.py	7.08 KB	-rwxr-xr-x
random.py	26.8 KB	-rw-r--r--
re.py	15.19 KB	-rw-r--r--
reprlib.py	5.21 KB	-rw-r--r--
rlcompleter.py	6.93 KB	-rw-r--r--
runpy.py	11.68 KB	-rw-r--r--
sched.py	6.36 KB	-rw-r--r--
secrets.py	1.99 KB	-rw-r--r--
selectors.py	18.98 KB	-rw-r--r--
shelve.py	8.32 KB	-rw-r--r--
shlex.py	12.65 KB	-rw-r--r--
shutil.py	39.59 KB	-rw-r--r--
signal.py	2.07 KB	-rw-r--r--
site.py	20.77 KB	-rw-r--r--
smtpd.py	33.9 KB	-rwxr-xr-x
smtplib.py	43.17 KB	-rwxr-xr-x
sndhdr.py	6.92 KB	-rw-r--r--
socket.py	26.8 KB	-rw-r--r--
socketserver.py	26.38 KB	-rw-r--r--
sre_compile.py	18.88 KB	-rw-r--r--
sre_constants.py	6.66 KB	-rw-r--r--
sre_parse.py	35.68 KB	-rw-r--r--
ssl.py	43.47 KB	-rw-r--r--
stat.py	4.92 KB	-rw-r--r--
statistics.py	20.19 KB	-rw-r--r--
string.py	11.52 KB	-rw-r--r--
stringprep.py	12.61 KB	-rw-r--r--
struct.py	257 B	-rw-r--r--
subprocess.py	60.88 KB	-rw-r--r--
sunau.py	17.67 KB	-rw-r--r--
symbol.py	2.06 KB	-rwxr-xr-x
symtable.py	7.11 KB	-rw-r--r--
sysconfig.py	24.4 KB	-rw-r--r--
tabnanny.py	11.13 KB	-rwxr-xr-x
tarfile.py	92.62 KB	-rwxr-xr-x
telnetlib.py	22.59 KB	-rw-r--r--
tempfile.py	27.41 KB	-rw-r--r--
textwrap.py	19.1 KB	-rw-r--r--
this.py	1003 B	-rw-r--r--
threading.py	47.88 KB	-rw-r--r--
timeit.py	13.02 KB	-rwxr-xr-x
token.py	3 KB	-rw-r--r--
tokenize.py	28.8 KB	-rw-r--r--
trace.py	28.05 KB	-rwxr-xr-x
traceback.py	22.91 KB	-rw-r--r--
tracemalloc.py	16.27 KB	-rw-r--r--
tty.py	879 B	-rw-r--r--
types.py	8.66 KB	-rw-r--r--
typing.py	78.39 KB	-rw-r--r--
uu.py	6.59 KB	-rwxr-xr-x
uuid.py	23.46 KB	-rw-r--r--
warnings.py	18.05 KB	-rw-r--r--
wave.py	17.29 KB	-rw-r--r--
weakref.py	19.99 KB	-rw-r--r--
webbrowser.py	21.25 KB	-rwxr-xr-x
xdrlib.py	5.77 KB	-rw-r--r--
zipapp.py	6.99 KB	-rw-r--r--
zipfile.py	74.49 KB	-rw-r--r--

Code Editor : 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