Linux server1.hosting4iran.com 4.18.0-553.123.2.el8_10.x86_64 #1 SMP Thu May 7 15:28:41 EDT 2026 x86_64
LiteSpeed
Server IP : 185.208.174.156 & Your IP : 216.73.216.67
Domains : 318 Domain
User : satitravel
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
share /
doc /
python2-docs /
html /
library /
Delete
Unzip
Name
Size
Permission
Date
Action
2to3.html
58.11
KB
-rw-r--r--
2019-03-27 12:19
__builtin__.html
10.81
KB
-rw-r--r--
2019-03-27 12:19
__future__.html
14.34
KB
-rw-r--r--
2019-03-27 12:19
__main__.html
7.34
KB
-rw-r--r--
2019-03-27 12:19
_winreg.html
63.12
KB
-rw-r--r--
2019-03-27 12:19
abc.html
25.22
KB
-rw-r--r--
2019-03-27 12:19
aepack.html
13.83
KB
-rw-r--r--
2019-03-27 12:19
aetools.html
16
KB
-rw-r--r--
2019-03-27 12:19
aetypes.html
20.53
KB
-rw-r--r--
2019-03-27 12:19
aifc.html
24.48
KB
-rw-r--r--
2019-03-27 12:19
al.html
18.23
KB
-rw-r--r--
2019-03-27 12:19
allos.html
34.47
KB
-rw-r--r--
2019-03-27 12:19
anydbm.html
17.7
KB
-rw-r--r--
2019-03-27 12:19
archiving.html
9.84
KB
-rw-r--r--
2019-03-27 12:19
argparse.html
257.44
KB
-rw-r--r--
2019-03-27 12:19
array.html
31.11
KB
-rw-r--r--
2019-03-27 12:19
ast.html
37.27
KB
-rw-r--r--
2019-03-27 12:19
asynchat.html
33.13
KB
-rw-r--r--
2019-03-27 12:19
asyncore.html
39.68
KB
-rw-r--r--
2019-03-27 12:19
atexit.html
18.02
KB
-rw-r--r--
2019-03-27 12:19
audioop.html
33.45
KB
-rw-r--r--
2019-03-27 12:19
autogil.html
8.53
KB
-rw-r--r--
2019-03-27 12:19
base64.html
21.35
KB
-rw-r--r--
2019-03-27 12:19
basehttpserver.html
36.56
KB
-rw-r--r--
2019-03-27 12:19
bastion.html
11.52
KB
-rw-r--r--
2019-03-27 12:19
bdb.html
40.42
KB
-rw-r--r--
2019-03-27 12:19
binascii.html
22.46
KB
-rw-r--r--
2019-03-27 12:19
binhex.html
11.04
KB
-rw-r--r--
2019-03-27 12:19
bisect.html
24.09
KB
-rw-r--r--
2019-03-27 12:19
bsddb.html
27.92
KB
-rw-r--r--
2019-03-27 12:19
bz2.html
28.37
KB
-rw-r--r--
2019-03-27 12:19
calendar.html
40.78
KB
-rw-r--r--
2019-03-27 12:19
carbon.html
50.78
KB
-rw-r--r--
2019-03-27 12:19
cd.html
29.33
KB
-rw-r--r--
2019-03-27 12:19
cgi.html
54.61
KB
-rw-r--r--
2019-03-27 12:19
cgihttpserver.html
13.7
KB
-rw-r--r--
2019-03-27 12:19
cgitb.html
11.98
KB
-rw-r--r--
2019-03-27 12:19
chunk.html
15.53
KB
-rw-r--r--
2019-03-27 12:19
cmath.html
27.7
KB
-rw-r--r--
2019-03-27 12:19
cmd.html
28.36
KB
-rw-r--r--
2019-03-27 12:19
code.html
26.33
KB
-rw-r--r--
2019-03-27 12:19
codecs.html
115.49
KB
-rw-r--r--
2019-03-27 12:19
codeop.html
15.53
KB
-rw-r--r--
2019-03-27 12:19
collections.html
144.19
KB
-rw-r--r--
2019-03-27 12:19
colorpicker.html
7.85
KB
-rw-r--r--
2019-03-27 12:19
colorsys.html
11.64
KB
-rw-r--r--
2019-03-27 12:19
commands.html
15.15
KB
-rw-r--r--
2019-03-27 12:19
compileall.html
18.18
KB
-rw-r--r--
2019-03-27 12:19
compiler.html
74.12
KB
-rw-r--r--
2019-03-27 12:19
configparser.html
66.16
KB
-rw-r--r--
2019-03-27 12:19
constants.html
13.65
KB
-rw-r--r--
2019-03-27 12:19
contextlib.html
22.24
KB
-rw-r--r--
2019-03-27 12:19
cookie.html
40.87
KB
-rw-r--r--
2019-03-27 12:19
cookielib.html
88.9
KB
-rw-r--r--
2019-03-27 12:19
copy.html
12.7
KB
-rw-r--r--
2019-03-27 12:19
copy_reg.html
14.35
KB
-rw-r--r--
2019-03-27 12:19
crypt.html
10.4
KB
-rw-r--r--
2019-03-27 12:19
crypto.html
7.58
KB
-rw-r--r--
2019-03-27 12:19
csv.html
74.66
KB
-rw-r--r--
2019-03-27 12:19
ctypes.html
258.37
KB
-rw-r--r--
2019-03-27 12:19
curses.ascii.html
24.29
KB
-rw-r--r--
2019-03-27 12:19
curses.html
163.58
KB
-rw-r--r--
2019-03-27 12:19
curses.panel.html
15.45
KB
-rw-r--r--
2019-03-27 12:19
custominterp.html
7.84
KB
-rw-r--r--
2019-03-27 12:19
datatypes.html
17.59
KB
-rw-r--r--
2019-03-27 12:19
datetime.html
247.5
KB
-rw-r--r--
2019-03-27 12:19
dbhash.html
16.43
KB
-rw-r--r--
2019-03-27 12:19
dbm.html
13.19
KB
-rw-r--r--
2019-03-27 12:19
debug.html
10.45
KB
-rw-r--r--
2019-03-27 12:19
decimal.html
217.1
KB
-rw-r--r--
2019-03-27 12:19
development.html
14.48
KB
-rw-r--r--
2019-03-27 12:19
difflib.html
89.82
KB
-rw-r--r--
2019-03-27 12:19
dircache.html
12.01
KB
-rw-r--r--
2019-03-27 12:19
dis.html
82.18
KB
-rw-r--r--
2019-03-27 12:19
distribution.html
7.5
KB
-rw-r--r--
2019-03-27 12:19
distutils.html
9.91
KB
-rw-r--r--
2019-03-27 12:19
dl.html
17.25
KB
-rw-r--r--
2019-03-27 12:19
doctest.html
181.53
KB
-rw-r--r--
2019-03-27 12:19
docxmlrpcserver.html
17.16
KB
-rw-r--r--
2019-03-27 12:19
dumbdbm.html
15.18
KB
-rw-r--r--
2019-03-27 12:19
dummy_thread.html
9.83
KB
-rw-r--r--
2019-03-27 12:19
dummy_threading.html
8.72
KB
-rw-r--r--
2019-03-27 12:19
easydialogs.html
32.35
KB
-rw-r--r--
2019-03-27 12:19
email-examples.html
46.31
KB
-rw-r--r--
2019-03-27 12:19
email.charset.html
28.73
KB
-rw-r--r--
2019-03-27 12:19
email.encoders.html
12.55
KB
-rw-r--r--
2019-03-27 12:19
email.errors.html
17.53
KB
-rw-r--r--
2019-03-27 12:19
email.generator.html
22.6
KB
-rw-r--r--
2019-03-27 12:19
email.header.html
28.43
KB
-rw-r--r--
2019-03-27 12:19
email.html
54.42
KB
-rw-r--r--
2019-03-27 12:19
email.iterators.html
12.33
KB
-rw-r--r--
2019-03-27 12:19
email.message.html
68.54
KB
-rw-r--r--
2019-03-27 12:19
email.mime.html
30.91
KB
-rw-r--r--
2019-03-27 12:19
email.parser.html
34.32
KB
-rw-r--r--
2019-03-27 12:19
email.utils.html
26.44
KB
-rw-r--r--
2019-03-27 12:19
ensurepip.html
17.9
KB
-rw-r--r--
2019-03-27 12:19
errno.html
39.3
KB
-rw-r--r--
2019-03-27 12:19
exceptions.html
62.2
KB
-rw-r--r--
2019-03-27 12:19
fcntl.html
25.63
KB
-rw-r--r--
2019-03-27 12:19
filecmp.html
23.43
KB
-rw-r--r--
2019-03-27 12:19
fileformats.html
9.43
KB
-rw-r--r--
2019-03-27 12:19
fileinput.html
26.44
KB
-rw-r--r--
2019-03-27 12:19
filesys.html
10.61
KB
-rw-r--r--
2019-03-27 12:19
fl.html
55.2
KB
-rw-r--r--
2019-03-27 12:19
fm.html
12.7
KB
-rw-r--r--
2019-03-27 12:19
fnmatch.html
15.88
KB
-rw-r--r--
2019-03-27 12:19
formatter.html
36.5
KB
-rw-r--r--
2019-03-27 12:19
fpectl.html
16.48
KB
-rw-r--r--
2019-03-27 12:19
fpformat.html
11.19
KB
-rw-r--r--
2019-03-27 12:19
fractions.html
24.3
KB
-rw-r--r--
2019-03-27 12:19
framework.html
36.07
KB
-rw-r--r--
2019-03-27 12:19
frameworks.html
7.37
KB
-rw-r--r--
2019-03-27 12:19
ftplib.html
48.42
KB
-rw-r--r--
2019-03-27 12:19
functions.html
200.82
KB
-rw-r--r--
2019-03-27 12:19
functools.html
28.95
KB
-rw-r--r--
2019-03-27 12:19
future_builtins.html
14.14
KB
-rw-r--r--
2019-03-27 12:19
gc.html
27.76
KB
-rw-r--r--
2019-03-27 12:19
gdbm.html
17.39
KB
-rw-r--r--
2019-03-27 12:19
gensuitemodule.html
12.28
KB
-rw-r--r--
2019-03-27 12:19
getopt.html
24.69
KB
-rw-r--r--
2019-03-27 12:19
getpass.html
11.16
KB
-rw-r--r--
2019-03-27 12:19
gettext.html
82.98
KB
-rw-r--r--
2019-03-27 12:19
gl.html
23.77
KB
-rw-r--r--
2019-03-27 12:19
glob.html
14.09
KB
-rw-r--r--
2019-03-27 12:19
grp.html
11.05
KB
-rw-r--r--
2019-03-27 12:19
gzip.html
20.09
KB
-rw-r--r--
2019-03-27 12:19
hashlib.html
24.87
KB
-rw-r--r--
2019-03-27 12:19
heapq.html
34.07
KB
-rw-r--r--
2019-03-27 12:19
hmac.html
14.04
KB
-rw-r--r--
2019-03-27 12:19
hotshot.html
19.67
KB
-rw-r--r--
2019-03-27 12:19
htmllib.html
27.03
KB
-rw-r--r--
2019-03-27 12:19
htmlparser.html
41.44
KB
-rw-r--r--
2019-03-27 12:19
httplib.html
69.27
KB
-rw-r--r--
2019-03-27 12:19
i18n.html
9.81
KB
-rw-r--r--
2019-03-27 12:19
ic.html
18.22
KB
-rw-r--r--
2019-03-27 12:19
idle.html
41.16
KB
-rw-r--r--
2019-03-27 12:19
imageop.html
15.72
KB
-rw-r--r--
2019-03-27 12:19
imaplib.html
57.14
KB
-rw-r--r--
2019-03-27 12:19
imgfile.html
12.43
KB
-rw-r--r--
2019-03-27 12:19
imghdr.html
11.95
KB
-rw-r--r--
2019-03-27 12:19
imp.html
36.72
KB
-rw-r--r--
2019-03-27 12:19
importlib.html
8.72
KB
-rw-r--r--
2019-03-27 12:19
imputil.html
32.78
KB
-rw-r--r--
2019-03-27 12:19
index.html
77.23
KB
-rw-r--r--
2019-03-27 12:19
inspect.html
55.49
KB
-rw-r--r--
2019-03-27 12:19
internet.html
25.53
KB
-rw-r--r--
2019-03-27 12:19
intro.html
9.13
KB
-rw-r--r--
2019-03-27 12:19
io.html
111.04
KB
-rw-r--r--
2019-03-27 12:19
ipc.html
16.21
KB
-rw-r--r--
2019-03-27 12:19
itertools.html
122.46
KB
-rw-r--r--
2019-03-27 12:19
jpeg.html
13.43
KB
-rw-r--r--
2019-03-27 12:19
json.html
71.95
KB
-rw-r--r--
2019-03-27 12:19
keyword.html
8.02
KB
-rw-r--r--
2019-03-27 12:19
language.html
11.41
KB
-rw-r--r--
2019-03-27 12:19
linecache.html
11.15
KB
-rw-r--r--
2019-03-27 12:19
locale.html
60.13
KB
-rw-r--r--
2019-03-27 12:19
logging.config.html
78.17
KB
-rw-r--r--
2019-03-27 12:19
logging.handlers.html
78.31
KB
-rw-r--r--
2019-03-27 12:19
logging.html
107.67
KB
-rw-r--r--
2019-03-27 12:19
mac.html
22.83
KB
-rw-r--r--
2019-03-27 12:19
macos.html
15.75
KB
-rw-r--r--
2019-03-27 12:19
macosa.html
13.75
KB
-rw-r--r--
2019-03-27 12:19
macostools.html
16.5
KB
-rw-r--r--
2019-03-27 12:19
macpath.html
8.19
KB
-rw-r--r--
2019-03-27 12:19
mailbox.html
167.11
KB
-rw-r--r--
2019-03-27 12:19
mailcap.html
13.8
KB
-rw-r--r--
2019-03-27 12:19
markup.html
19.4
KB
-rw-r--r--
2019-03-27 12:19
marshal.html
19
KB
-rw-r--r--
2019-03-27 12:19
math.html
42.98
KB
-rw-r--r--
2019-03-27 12:19
md5.html
14.77
KB
-rw-r--r--
2019-03-27 12:19
mhlib.html
23.56
KB
-rw-r--r--
2019-03-27 12:19
mimetools.html
20.71
KB
-rw-r--r--
2019-03-27 12:19
mimetypes.html
29.92
KB
-rw-r--r--
2019-03-27 12:19
mimewriter.html
15.7
KB
-rw-r--r--
2019-03-27 12:19
mimify.html
14.92
KB
-rw-r--r--
2019-03-27 12:19
miniaeframe.html
12.8
KB
-rw-r--r--
2019-03-27 12:19
misc.html
7.07
KB
-rw-r--r--
2019-03-27 12:19
mm.html
9.35
KB
-rw-r--r--
2019-03-27 12:19
mmap.html
30.11
KB
-rw-r--r--
2019-03-27 12:19
modulefinder.html
17.67
KB
-rw-r--r--
2019-03-27 12:19
modules.html
8.81
KB
-rw-r--r--
2019-03-27 12:19
msilib.html
56.5
KB
-rw-r--r--
2019-03-27 12:19
msvcrt.html
20.73
KB
-rw-r--r--
2019-03-27 12:19
multifile.html
25.64
KB
-rw-r--r--
2019-03-27 12:19
multiprocessing.html
404.82
KB
-rw-r--r--
2019-03-27 12:19
mutex.html
11.86
KB
-rw-r--r--
2019-03-27 12:19
netdata.html
17.95
KB
-rw-r--r--
2019-03-27 12:19
netrc.html
13.69
KB
-rw-r--r--
2019-03-27 12:19
new.html
12.87
KB
-rw-r--r--
2019-03-27 12:19
nis.html
11.23
KB
-rw-r--r--
2019-03-27 12:19
nntplib.html
44.62
KB
-rw-r--r--
2019-03-27 12:19
numbers.html
39.68
KB
-rw-r--r--
2019-03-27 12:19
numeric.html
13.96
KB
-rw-r--r--
2019-03-27 12:19
operator.html
91.43
KB
-rw-r--r--
2019-03-27 12:19
optparse.html
244.25
KB
-rw-r--r--
2019-03-27 12:19
os.html
234.57
KB
-rw-r--r--
2019-03-27 12:19
os.path.html
42.38
KB
-rw-r--r--
2019-03-27 12:19
ossaudiodev.html
44.53
KB
-rw-r--r--
2019-03-27 12:19
othergui.html
9.18
KB
-rw-r--r--
2019-03-27 12:19
parser.html
41.56
KB
-rw-r--r--
2019-03-27 12:19
pdb.html
37.7
KB
-rw-r--r--
2019-03-27 12:19
persistence.html
15.31
KB
-rw-r--r--
2019-03-27 12:19
pickle.html
107.11
KB
-rw-r--r--
2019-03-27 12:19
pickletools.html
11.21
KB
-rw-r--r--
2019-03-27 12:19
pipes.html
19.22
KB
-rw-r--r--
2019-03-27 12:19
pkgutil.html
26.73
KB
-rw-r--r--
2019-03-27 12:19
platform.html
30.86
KB
-rw-r--r--
2019-03-27 12:19
plistlib.html
17.91
KB
-rw-r--r--
2019-03-27 12:19
popen2.html
26.95
KB
-rw-r--r--
2019-03-27 12:19
poplib.html
23.75
KB
-rw-r--r--
2019-03-27 12:19
posix.html
16.24
KB
-rw-r--r--
2019-03-27 12:19
posixfile.html
20.89
KB
-rw-r--r--
2019-03-27 12:19
pprint.html
31.45
KB
-rw-r--r--
2019-03-27 12:19
profile.html
71.08
KB
-rw-r--r--
2019-03-27 12:19
pty.html
9.96
KB
-rw-r--r--
2019-03-27 12:19
pwd.html
12.1
KB
-rw-r--r--
2019-03-27 12:19
py_compile.html
11.65
KB
-rw-r--r--
2019-03-27 12:19
pyclbr.html
15.44
KB
-rw-r--r--
2019-03-27 12:19
pydoc.html
13.33
KB
-rw-r--r--
2019-03-27 12:19
pyexpat.html
78.99
KB
-rw-r--r--
2019-03-27 12:19
python.html
12.55
KB
-rw-r--r--
2019-03-27 12:19
queue.html
26.23
KB
-rw-r--r--
2019-03-27 12:19
quopri.html
12.44
KB
-rw-r--r--
2019-03-27 12:19
random.html
41.72
KB
-rw-r--r--
2019-03-27 12:19
re.html
152.33
KB
-rw-r--r--
2019-03-27 12:19
readline.html
36.51
KB
-rw-r--r--
2019-03-27 12:19
repr.html
21.27
KB
-rw-r--r--
2019-03-27 12:19
resource.html
27.62
KB
-rw-r--r--
2019-03-27 12:19
restricted.html
12.08
KB
-rw-r--r--
2019-03-27 12:19
rexec.html
39.62
KB
-rw-r--r--
2019-03-27 12:19
rfc822.html
45.32
KB
-rw-r--r--
2019-03-27 12:19
rlcompleter.html
14.12
KB
-rw-r--r--
2019-03-27 12:19
robotparser.html
13.09
KB
-rw-r--r--
2019-03-27 12:19
runpy.html
21.41
KB
-rw-r--r--
2019-03-27 12:19
sched.html
19.41
KB
-rw-r--r--
2019-03-27 12:19
scrolledtext.html
9.5
KB
-rw-r--r--
2019-03-27 12:19
select.html
43.06
KB
-rw-r--r--
2019-03-27 12:19
sets.html
39.21
KB
-rw-r--r--
2019-03-27 12:19
sgi.html
10.13
KB
-rw-r--r--
2019-03-27 12:19
sgmllib.html
33.66
KB
-rw-r--r--
2019-03-27 12:19
sha.html
12.76
KB
-rw-r--r--
2019-03-27 12:19
shelve.html
29.25
KB
-rw-r--r--
2019-03-27 12:19
shlex.html
34.21
KB
-rw-r--r--
2019-03-27 12:19
shutil.html
44.39
KB
-rw-r--r--
2019-03-27 12:19
signal.html
33.23
KB
-rw-r--r--
2019-03-27 12:19
simplehttpserver.html
19.87
KB
-rw-r--r--
2019-03-27 12:19
simplexmlrpcserver.html
36.91
KB
-rw-r--r--
2019-03-27 12:19
site.html
26.26
KB
-rw-r--r--
2019-03-27 12:19
smtpd.html
13.27
KB
-rw-r--r--
2019-03-27 12:19
smtplib.html
45.95
KB
-rw-r--r--
2019-03-27 12:19
sndhdr.html
10.74
KB
-rw-r--r--
2019-03-27 12:19
socket.html
113.69
KB
-rw-r--r--
2019-03-27 12:19
socketserver.html
74.64
KB
-rw-r--r--
2019-03-27 12:19
someos.html
16.09
KB
-rw-r--r--
2019-03-27 12:19
spwd.html
10.9
KB
-rw-r--r--
2019-03-27 12:19
sqlite3.html
146.5
KB
-rw-r--r--
2019-03-27 12:19
ssl.html
197.71
KB
-rw-r--r--
2019-03-27 12:19
stat.html
33.79
KB
-rw-r--r--
2019-03-27 12:19
statvfs.html
11.06
KB
-rw-r--r--
2019-03-27 12:19
stdtypes.html
291.16
KB
-rw-r--r--
2019-03-27 12:19
string.html
117.4
KB
-rw-r--r--
2019-03-27 12:19
stringio.html
19.59
KB
-rw-r--r--
2019-03-27 12:19
stringprep.html
17.31
KB
-rw-r--r--
2019-03-27 12:19
strings.html
15.53
KB
-rw-r--r--
2019-03-27 12:19
struct.html
43.84
KB
-rw-r--r--
2019-03-27 12:19
subprocess.html
107.86
KB
-rw-r--r--
2019-03-27 12:19
sun.html
7.08
KB
-rw-r--r--
2019-03-27 12:19
sunau.html
29.31
KB
-rw-r--r--
2019-03-27 12:19
sunaudio.html
18.79
KB
-rw-r--r--
2019-03-27 12:19
symbol.html
7.95
KB
-rw-r--r--
2019-03-27 12:19
symtable.html
25.26
KB
-rw-r--r--
2019-03-27 12:19
sys.html
108.39
KB
-rw-r--r--
2019-03-27 12:19
sysconfig.html
25.68
KB
-rw-r--r--
2019-03-27 12:19
syslog.html
19.27
KB
-rw-r--r--
2019-03-27 12:19
tabnanny.html
11.13
KB
-rw-r--r--
2019-03-27 12:19
tarfile.html
86.65
KB
-rw-r--r--
2019-03-27 12:19
telnetlib.html
27.13
KB
-rw-r--r--
2019-03-27 12:19
tempfile.html
31.16
KB
-rw-r--r--
2019-03-27 12:19
termios.html
16.9
KB
-rw-r--r--
2019-03-27 12:19
test.html
55.69
KB
-rw-r--r--
2019-03-27 12:19
textwrap.html
29.43
KB
-rw-r--r--
2019-03-27 12:19
thread.html
20.98
KB
-rw-r--r--
2019-03-27 12:19
threading.html
84.62
KB
-rw-r--r--
2019-03-27 12:19
time.html
62.3
KB
-rw-r--r--
2019-03-27 12:19
timeit.html
39.58
KB
-rw-r--r--
2019-03-27 12:19
tix.html
49.4
KB
-rw-r--r--
2019-03-27 12:19
tk.html
25.95
KB
-rw-r--r--
2019-03-27 12:19
tkinter.html
82.34
KB
-rw-r--r--
2019-03-27 12:19
token.html
20.51
KB
-rw-r--r--
2019-03-27 12:19
tokenize.html
20.12
KB
-rw-r--r--
2019-03-27 12:19
trace.html
28
KB
-rw-r--r--
2019-03-27 12:19
traceback.html
39.94
KB
-rw-r--r--
2019-03-27 12:19
ttk.html
105.97
KB
-rw-r--r--
2019-03-27 12:19
tty.html
9.52
KB
-rw-r--r--
2019-03-27 12:19
turtle.html
225.08
KB
-rw-r--r--
2019-03-27 12:19
types.html
29.13
KB
-rw-r--r--
2019-03-27 12:19
undoc.html
24.1
KB
-rw-r--r--
2019-03-27 12:19
unicodedata.html
19.71
KB
-rw-r--r--
2019-03-27 12:19
unittest.html
219.75
KB
-rw-r--r--
2019-03-27 12:19
unix.html
10.96
KB
-rw-r--r--
2019-03-27 12:19
urllib.html
66.67
KB
-rw-r--r--
2019-03-27 12:19
urllib2.html
110.72
KB
-rw-r--r--
2019-03-27 12:19
urlparse.html
42.46
KB
-rw-r--r--
2019-03-27 12:19
user.html
12.41
KB
-rw-r--r--
2019-03-27 12:19
userdict.html
31.32
KB
-rw-r--r--
2019-03-27 12:19
uu.html
11.53
KB
-rw-r--r--
2019-03-27 12:19
uuid.html
29.43
KB
-rw-r--r--
2019-03-27 12:19
warnings.html
49.76
KB
-rw-r--r--
2019-03-27 12:19
wave.html
24.31
KB
-rw-r--r--
2019-03-27 12:19
weakref.html
37.9
KB
-rw-r--r--
2019-03-27 12:19
webbrowser.html
25.94
KB
-rw-r--r--
2019-03-27 12:19
whichdb.html
9.28
KB
-rw-r--r--
2019-03-27 12:19
windows.html
9.59
KB
-rw-r--r--
2019-03-27 12:19
winsound.html
19.99
KB
-rw-r--r--
2019-03-27 12:19
wsgiref.html
86.31
KB
-rw-r--r--
2019-03-27 12:19
xdrlib.html
32.24
KB
-rw-r--r--
2019-03-27 12:19
xml.dom.html
95.58
KB
-rw-r--r--
2019-03-27 12:19
xml.dom.minidom.html
42.22
KB
-rw-r--r--
2019-03-27 12:19
xml.dom.pulldom.html
13.51
KB
-rw-r--r--
2019-03-27 12:19
xml.etree.elementtree.html
109.18
KB
-rw-r--r--
2019-03-27 12:19
xml.html
17.58
KB
-rw-r--r--
2019-03-27 12:19
xml.sax.handler.html
40.9
KB
-rw-r--r--
2019-03-27 12:19
xml.sax.html
22.91
KB
-rw-r--r--
2019-03-27 12:19
xml.sax.reader.html
43.75
KB
-rw-r--r--
2019-03-27 12:19
xml.sax.utils.html
15.71
KB
-rw-r--r--
2019-03-27 12:19
xmlrpclib.html
67.57
KB
-rw-r--r--
2019-03-27 12:19
zipfile.html
60.77
KB
-rw-r--r--
2019-03-27 12:19
zipimport.html
22.24
KB
-rw-r--r--
2019-03-27 12:19
zlib.html
30.5
KB
-rw-r--r--
2019-03-27 12:19
Save
Rename
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="X-UA-Compatible" content="IE=Edge" /> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>8.5. bisect — Array bisection algorithm — Python 2.7.16 documentation</title> <link rel="stylesheet" href="../_static/classic.css" type="text/css" /> <link rel="stylesheet" href="../_static/pygments.css" type="text/css" /> <script type="text/javascript" id="documentation_options" data-url_root="../" src="../_static/documentation_options.js"></script> <script type="text/javascript" src="../_static/jquery.js"></script> <script type="text/javascript" src="../_static/underscore.js"></script> <script type="text/javascript" src="../_static/doctools.js"></script> <script type="text/javascript" src="../_static/sidebar.js"></script> <link rel="search" type="application/opensearchdescription+xml" title="Search within Python 2.7.16 documentation" href="../_static/opensearch.xml"/> <link rel="author" title="About these documents" href="../about.html" /> <link rel="index" title="Index" href="../genindex.html" /> <link rel="search" title="Search" href="../search.html" /> <link rel="copyright" title="Copyright" href="../copyright.html" /> <link rel="next" title="8.6. array — Efficient arrays of numeric values" href="array.html" /> <link rel="prev" title="8.4. heapq — Heap queue algorithm" href="heapq.html" /> <link rel="shortcut icon" type="image/png" href="../_static/py.png" /> <link rel="canonical" href="https://docs.python.org/2/library/bisect.html" /> <script type="text/javascript" src="../_static/copybutton.js"></script> </head><body> <div class="related" role="navigation" aria-label="related navigation"> <h3>Navigation</h3> <ul> <li class="right" style="margin-right: 10px"> <a href="../genindex.html" title="General Index" accesskey="I">index</a></li> <li class="right" > <a href="../py-modindex.html" title="Python Module Index" >modules</a> |</li> <li class="right" > <a href="array.html" title="8.6. array — Efficient arrays of numeric values" accesskey="N">next</a> |</li> <li class="right" > <a href="heapq.html" title="8.4. heapq — Heap queue algorithm" accesskey="P">previous</a> |</li> <li><img src="../_static/py.png" alt="" style="vertical-align: middle; margin-top: -1px"/></li> <li><a href="https://www.python.org/">Python</a> »</li> <li> <a href="../index.html">Python 2.7.16 documentation</a> » </li> <li class="nav-item nav-item-1"><a href="index.html" >The Python Standard Library</a> »</li> <li class="nav-item nav-item-2"><a href="datatypes.html" accesskey="U">8. Data Types</a> »</li> </ul> </div> <div class="document"> <div class="documentwrapper"> <div class="bodywrapper"> <div class="body" role="main"> <div class="section" id="module-bisect"> <span id="bisect-array-bisection-algorithm"></span><h1>8.5. <a class="reference internal" href="#module-bisect" title="bisect: Array bisection algorithms for binary searching."><code class="xref py py-mod docutils literal notranslate"><span class="pre">bisect</span></code></a> — Array bisection algorithm<a class="headerlink" href="#module-bisect" title="Permalink to this headline">¶</a></h1> <div class="versionadded"> <p><span class="versionmodified">New in version 2.1.</span></p> </div> <p><strong>Source code:</strong> <a class="reference external" href="https://github.com/python/cpython/tree/2.7/Lib/bisect.py">Lib/bisect.py</a></p> <hr class="docutils" /> <p>This module provides support for maintaining a list in sorted order without having to sort the list after each insertion. For long lists of items with expensive comparison operations, this can be an improvement over the more common approach. The module is called <a class="reference internal" href="#module-bisect" title="bisect: Array bisection algorithms for binary searching."><code class="xref py py-mod docutils literal notranslate"><span class="pre">bisect</span></code></a> because it uses a basic bisection algorithm to do its work. The source code may be most useful as a working example of the algorithm (the boundary conditions are already right!).</p> <p>The following functions are provided:</p> <dl class="function"> <dt id="bisect.bisect_left"> <code class="descclassname">bisect.</code><code class="descname">bisect_left</code><span class="sig-paren">(</span><em>a</em>, <em>x</em>, <em>lo=0</em>, <em>hi=len(a)</em><span class="sig-paren">)</span><a class="headerlink" href="#bisect.bisect_left" title="Permalink to this definition">¶</a></dt> <dd><p>Locate the insertion point for <em>x</em> in <em>a</em> to maintain sorted order. The parameters <em>lo</em> and <em>hi</em> may be used to specify a subset of the list which should be considered; by default the entire list is used. If <em>x</em> is already present in <em>a</em>, the insertion point will be before (to the left of) any existing entries. The return value is suitable for use as the first parameter to <code class="docutils literal notranslate"><span class="pre">list.insert()</span></code> assuming that <em>a</em> is already sorted.</p> <p>The returned insertion point <em>i</em> partitions the array <em>a</em> into two halves so that <code class="docutils literal notranslate"><span class="pre">all(val</span> <span class="pre"><</span> <span class="pre">x</span> <span class="pre">for</span> <span class="pre">val</span> <span class="pre">in</span> <span class="pre">a[lo:i])</span></code> for the left side and <code class="docutils literal notranslate"><span class="pre">all(val</span> <span class="pre">>=</span> <span class="pre">x</span> <span class="pre">for</span> <span class="pre">val</span> <span class="pre">in</span> <span class="pre">a[i:hi])</span></code> for the right side.</p> </dd></dl> <dl class="function"> <dt id="bisect.bisect_right"> <code class="descclassname">bisect.</code><code class="descname">bisect_right</code><span class="sig-paren">(</span><em>a</em>, <em>x</em>, <em>lo=0</em>, <em>hi=len(a)</em><span class="sig-paren">)</span><a class="headerlink" href="#bisect.bisect_right" title="Permalink to this definition">¶</a></dt> <dt id="bisect.bisect"> <code class="descclassname">bisect.</code><code class="descname">bisect</code><span class="sig-paren">(</span><em>a</em>, <em>x</em>, <em>lo=0</em>, <em>hi=len(a)</em><span class="sig-paren">)</span><a class="headerlink" href="#bisect.bisect" title="Permalink to this definition">¶</a></dt> <dd><p>Similar to <a class="reference internal" href="#bisect.bisect_left" title="bisect.bisect_left"><code class="xref py py-func docutils literal notranslate"><span class="pre">bisect_left()</span></code></a>, but returns an insertion point which comes after (to the right of) any existing entries of <em>x</em> in <em>a</em>.</p> <p>The returned insertion point <em>i</em> partitions the array <em>a</em> into two halves so that <code class="docutils literal notranslate"><span class="pre">all(val</span> <span class="pre"><=</span> <span class="pre">x</span> <span class="pre">for</span> <span class="pre">val</span> <span class="pre">in</span> <span class="pre">a[lo:i])</span></code> for the left side and <code class="docutils literal notranslate"><span class="pre">all(val</span> <span class="pre">></span> <span class="pre">x</span> <span class="pre">for</span> <span class="pre">val</span> <span class="pre">in</span> <span class="pre">a[i:hi])</span></code> for the right side.</p> </dd></dl> <dl class="function"> <dt id="bisect.insort_left"> <code class="descclassname">bisect.</code><code class="descname">insort_left</code><span class="sig-paren">(</span><em>a</em>, <em>x</em>, <em>lo=0</em>, <em>hi=len(a)</em><span class="sig-paren">)</span><a class="headerlink" href="#bisect.insort_left" title="Permalink to this definition">¶</a></dt> <dd><p>Insert <em>x</em> in <em>a</em> in sorted order. This is equivalent to <code class="docutils literal notranslate"><span class="pre">a.insert(bisect.bisect_left(a,</span> <span class="pre">x,</span> <span class="pre">lo,</span> <span class="pre">hi),</span> <span class="pre">x)</span></code> assuming that <em>a</em> is already sorted. Keep in mind that the O(log n) search is dominated by the slow O(n) insertion step.</p> </dd></dl> <dl class="function"> <dt id="bisect.insort_right"> <code class="descclassname">bisect.</code><code class="descname">insort_right</code><span class="sig-paren">(</span><em>a</em>, <em>x</em>, <em>lo=0</em>, <em>hi=len(a)</em><span class="sig-paren">)</span><a class="headerlink" href="#bisect.insort_right" title="Permalink to this definition">¶</a></dt> <dt id="bisect.insort"> <code class="descclassname">bisect.</code><code class="descname">insort</code><span class="sig-paren">(</span><em>a</em>, <em>x</em>, <em>lo=0</em>, <em>hi=len(a)</em><span class="sig-paren">)</span><a class="headerlink" href="#bisect.insort" title="Permalink to this definition">¶</a></dt> <dd><p>Similar to <a class="reference internal" href="#bisect.insort_left" title="bisect.insort_left"><code class="xref py py-func docutils literal notranslate"><span class="pre">insort_left()</span></code></a>, but inserting <em>x</em> in <em>a</em> after any existing entries of <em>x</em>.</p> </dd></dl> <div class="admonition seealso"> <p class="first admonition-title">See also</p> <p class="last"><a class="reference external" href="https://code.activestate.com/recipes/577197-sortedcollection/">SortedCollection recipe</a> that uses bisect to build a full-featured collection class with straight-forward search methods and support for a key-function. The keys are precomputed to save unnecessary calls to the key function during searches.</p> </div> <div class="section" id="searching-sorted-lists"> <h2>8.5.1. Searching Sorted Lists<a class="headerlink" href="#searching-sorted-lists" title="Permalink to this headline">¶</a></h2> <p>The above <a class="reference internal" href="#module-bisect" title="bisect: Array bisection algorithms for binary searching."><code class="xref py py-func docutils literal notranslate"><span class="pre">bisect()</span></code></a> functions are useful for finding insertion points but can be tricky or awkward to use for common searching tasks. The following five functions show how to transform them into the standard lookups for sorted lists:</p> <div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">index</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">):</span> <span class="s1">'Locate the leftmost value exactly equal to x'</span> <span class="n">i</span> <span class="o">=</span> <span class="n">bisect_left</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">i</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">a</span><span class="p">)</span> <span class="ow">and</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">==</span> <span class="n">x</span><span class="p">:</span> <span class="k">return</span> <span class="n">i</span> <span class="k">raise</span> <span class="ne">ValueError</span> <span class="k">def</span> <span class="nf">find_lt</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">):</span> <span class="s1">'Find rightmost value less than x'</span> <span class="n">i</span> <span class="o">=</span> <span class="n">bisect_left</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">i</span><span class="p">:</span> <span class="k">return</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="k">raise</span> <span class="ne">ValueError</span> <span class="k">def</span> <span class="nf">find_le</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">):</span> <span class="s1">'Find rightmost value less than or equal to x'</span> <span class="n">i</span> <span class="o">=</span> <span class="n">bisect_right</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">i</span><span class="p">:</span> <span class="k">return</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="k">raise</span> <span class="ne">ValueError</span> <span class="k">def</span> <span class="nf">find_gt</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">):</span> <span class="s1">'Find leftmost value greater than x'</span> <span class="n">i</span> <span class="o">=</span> <span class="n">bisect_right</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">i</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">a</span><span class="p">):</span> <span class="k">return</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="k">raise</span> <span class="ne">ValueError</span> <span class="k">def</span> <span class="nf">find_ge</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">):</span> <span class="s1">'Find leftmost item greater than or equal to x'</span> <span class="n">i</span> <span class="o">=</span> <span class="n">bisect_left</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">i</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">a</span><span class="p">):</span> <span class="k">return</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="k">raise</span> <span class="ne">ValueError</span> </pre></div> </div> </div> <div class="section" id="other-examples"> <h2>8.5.2. Other Examples<a class="headerlink" href="#other-examples" title="Permalink to this headline">¶</a></h2> <p id="bisect-example">The <a class="reference internal" href="#module-bisect" title="bisect: Array bisection algorithms for binary searching."><code class="xref py py-func docutils literal notranslate"><span class="pre">bisect()</span></code></a> function can be useful for numeric table lookups. This example uses <a class="reference internal" href="#module-bisect" title="bisect: Array bisection algorithms for binary searching."><code class="xref py py-func docutils literal notranslate"><span class="pre">bisect()</span></code></a> to look up a letter grade for an exam score (say) based on a set of ordered numeric breakpoints: 90 and up is an ‘A’, 80 to 89 is a ‘B’, and so on:</p> <div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="k">def</span> <span class="nf">grade</span><span class="p">(</span><span class="n">score</span><span class="p">,</span> <span class="n">breakpoints</span><span class="o">=</span><span class="p">[</span><span class="mi">60</span><span class="p">,</span> <span class="mi">70</span><span class="p">,</span> <span class="mi">80</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span> <span class="n">grades</span><span class="o">=</span><span class="s1">'FDCBA'</span><span class="p">):</span> <span class="go"> i = bisect(breakpoints, score)</span> <span class="go"> return grades[i]</span> <span class="gp">>>> </span><span class="p">[</span><span class="n">grade</span><span class="p">(</span><span class="n">score</span><span class="p">)</span> <span class="k">for</span> <span class="n">score</span> <span class="ow">in</span> <span class="p">[</span><span class="mi">33</span><span class="p">,</span> <span class="mi">99</span><span class="p">,</span> <span class="mi">77</span><span class="p">,</span> <span class="mi">70</span><span class="p">,</span> <span class="mi">89</span><span class="p">,</span> <span class="mi">90</span><span class="p">,</span> <span class="mi">100</span><span class="p">]]</span> <span class="go">['F', 'A', 'C', 'C', 'B', 'A', 'A']</span> </pre></div> </div> <p>Unlike the <a class="reference internal" href="functions.html#sorted" title="sorted"><code class="xref py py-func docutils literal notranslate"><span class="pre">sorted()</span></code></a> function, it does not make sense for the <a class="reference internal" href="#module-bisect" title="bisect: Array bisection algorithms for binary searching."><code class="xref py py-func docutils literal notranslate"><span class="pre">bisect()</span></code></a> functions to have <em>key</em> or <em>reversed</em> arguments because that would lead to an inefficient design (successive calls to bisect functions would not “remember” all of the previous key lookups).</p> <p>Instead, it is better to search a list of precomputed keys to find the index of the record in question:</p> <div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="n">data</span> <span class="o">=</span> <span class="p">[(</span><span class="s1">'red'</span><span class="p">,</span> <span class="mi">5</span><span class="p">),</span> <span class="p">(</span><span class="s1">'blue'</span><span class="p">,</span> <span class="mi">1</span><span class="p">),</span> <span class="p">(</span><span class="s1">'yellow'</span><span class="p">,</span> <span class="mi">8</span><span class="p">),</span> <span class="p">(</span><span class="s1">'black'</span><span class="p">,</span> <span class="mi">0</span><span class="p">)]</span> <span class="gp">>>> </span><span class="n">data</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">r</span><span class="p">:</span> <span class="n">r</span><span class="p">[</span><span class="mi">1</span><span class="p">])</span> <span class="gp">>>> </span><span class="n">keys</span> <span class="o">=</span> <span class="p">[</span><span class="n">r</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="k">for</span> <span class="n">r</span> <span class="ow">in</span> <span class="n">data</span><span class="p">]</span> <span class="c1"># precomputed list of keys</span> <span class="gp">>>> </span><span class="n">data</span><span class="p">[</span><span class="n">bisect_left</span><span class="p">(</span><span class="n">keys</span><span class="p">,</span> <span class="mi">0</span><span class="p">)]</span> <span class="go">('black', 0)</span> <span class="gp">>>> </span><span class="n">data</span><span class="p">[</span><span class="n">bisect_left</span><span class="p">(</span><span class="n">keys</span><span class="p">,</span> <span class="mi">1</span><span class="p">)]</span> <span class="go">('blue', 1)</span> <span class="gp">>>> </span><span class="n">data</span><span class="p">[</span><span class="n">bisect_left</span><span class="p">(</span><span class="n">keys</span><span class="p">,</span> <span class="mi">5</span><span class="p">)]</span> <span class="go">('red', 5)</span> <span class="gp">>>> </span><span class="n">data</span><span class="p">[</span><span class="n">bisect_left</span><span class="p">(</span><span class="n">keys</span><span class="p">,</span> <span class="mi">8</span><span class="p">)]</span> <span class="go">('yellow', 8)</span> </pre></div> </div> </div> </div> </div> </div> </div> <div class="sphinxsidebar" role="navigation" aria-label="main navigation"> <div class="sphinxsidebarwrapper"> <h3><a href="../contents.html">Table Of Contents</a></h3> <ul> <li><a class="reference internal" href="#">8.5. <code class="docutils literal notranslate"><span class="pre">bisect</span></code> — Array bisection algorithm</a><ul> <li><a class="reference internal" href="#searching-sorted-lists">8.5.1. Searching Sorted Lists</a></li> <li><a class="reference internal" href="#other-examples">8.5.2. Other Examples</a></li> </ul> </li> </ul> <h4>Previous topic</h4> <p class="topless"><a href="heapq.html" title="previous chapter">8.4. <code class="docutils literal notranslate"><span class="pre">heapq</span></code> — Heap queue algorithm</a></p> <h4>Next topic</h4> <p class="topless"><a href="array.html" title="next chapter">8.6. <code class="docutils literal notranslate"><span class="pre">array</span></code> — Efficient arrays of numeric values</a></p> <div role="note" aria-label="source link"> <h3>This Page</h3> <ul class="this-page-menu"> <li><a href="../_sources/library/bisect.rst.txt" rel="nofollow">Show Source</a></li> </ul> </div> <div id="searchbox" style="display: none" role="search"> <h3>Quick search</h3> <div class="searchformwrapper"> <form class="search" action="../search.html" method="get"> <input type="text" name="q" /> <input type="submit" value="Go" /> <input type="hidden" name="check_keywords" value="yes" /> <input type="hidden" name="area" value="default" /> </form> </div> </div> <script type="text/javascript">$('#searchbox').show(0);</script> </div> </div> <div class="clearer"></div> </div> <div class="related" role="navigation" aria-label="related navigation"> <h3>Navigation</h3> <ul> <li class="right" style="margin-right: 10px"> <a href="../genindex.html" title="General Index" >index</a></li> <li class="right" > <a href="../py-modindex.html" title="Python Module Index" >modules</a> |</li> <li class="right" > <a href="array.html" title="8.6. array — Efficient arrays of numeric values" >next</a> |</li> <li class="right" > <a href="heapq.html" title="8.4. heapq — Heap queue algorithm" >previous</a> |</li> <li><img src="../_static/py.png" alt="" style="vertical-align: middle; margin-top: -1px"/></li> <li><a href="https://www.python.org/">Python</a> »</li> <li> <a href="../index.html">Python 2.7.16 documentation</a> » </li> <li class="nav-item nav-item-1"><a href="index.html" >The Python Standard Library</a> »</li> <li class="nav-item nav-item-2"><a href="datatypes.html" >8. Data Types</a> »</li> </ul> </div> <div class="footer"> © <a href="../copyright.html">Copyright</a> 1990-2019, Python Software Foundation. <br /> The Python Software Foundation is a non-profit corporation. <a href="https://www.python.org/psf/donations/">Please donate.</a> <br /> Last updated on Mar 27, 2019. <a href="../bugs.html">Found a bug</a>? <br /> Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.7.6. </div> </body> </html>