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.217.179
Domains : 326 Domain
User : satitravel
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
share /
doc /
python3-docs /
html /
library /
Delete
Unzip
Name
Size
Permission
Date
Action
2to3.html
60.26
KB
-rw-r--r--
2023-12-18 11:36
__future__.html
15.42
KB
-rw-r--r--
2023-12-18 11:36
__main__.html
8.81
KB
-rw-r--r--
2023-12-18 11:36
_dummy_thread.html
8.98
KB
-rw-r--r--
2023-12-18 11:36
_thread.html
22.06
KB
-rw-r--r--
2023-12-18 11:36
abc.html
40.42
KB
-rw-r--r--
2023-12-18 11:36
aifc.html
27.46
KB
-rw-r--r--
2023-12-18 11:36
allos.html
31.48
KB
-rw-r--r--
2023-12-18 11:36
archiving.html
11.71
KB
-rw-r--r--
2023-12-18 11:36
argparse.html
268.54
KB
-rw-r--r--
2023-12-18 11:36
array.html
32.76
KB
-rw-r--r--
2023-12-18 11:36
ast.html
38.67
KB
-rw-r--r--
2023-12-18 11:36
asynchat.html
31.78
KB
-rw-r--r--
2023-12-18 11:36
asyncio-dev.html
50.65
KB
-rw-r--r--
2023-12-18 11:36
asyncio-eventloop.html
108.61
KB
-rw-r--r--
2023-12-18 11:36
asyncio-eventloops.html
32.25
KB
-rw-r--r--
2023-12-18 11:36
asyncio-protocol.html
85.38
KB
-rw-r--r--
2023-12-18 11:36
asyncio-queue.html
23.4
KB
-rw-r--r--
2023-12-18 11:36
asyncio-stream.html
59.58
KB
-rw-r--r--
2023-12-18 11:36
asyncio-subprocess.html
56.66
KB
-rw-r--r--
2023-12-18 11:36
asyncio-sync.html
34.84
KB
-rw-r--r--
2023-12-18 11:36
asyncio-task.html
82
KB
-rw-r--r--
2023-12-18 11:36
asyncio.html
27.37
KB
-rw-r--r--
2023-12-18 11:36
asyncore.html
41.71
KB
-rw-r--r--
2023-12-18 11:36
atexit.html
18
KB
-rw-r--r--
2023-12-18 11:36
audioop.html
34.61
KB
-rw-r--r--
2023-12-18 11:36
base64.html
35.6
KB
-rw-r--r--
2023-12-18 11:36
bdb.html
42.41
KB
-rw-r--r--
2023-12-18 11:36
binary.html
12.42
KB
-rw-r--r--
2023-12-18 11:36
binascii.html
24.17
KB
-rw-r--r--
2023-12-18 11:36
binhex.html
11.4
KB
-rw-r--r--
2023-12-18 11:36
bisect.html
25
KB
-rw-r--r--
2023-12-18 11:36
builtins.html
11.33
KB
-rw-r--r--
2023-12-18 11:36
bz2.html
32.58
KB
-rw-r--r--
2023-12-18 11:36
calendar.html
38.61
KB
-rw-r--r--
2023-12-18 11:36
cgi.html
54.57
KB
-rw-r--r--
2023-12-18 11:36
cgitb.html
12.47
KB
-rw-r--r--
2023-12-18 11:36
chunk.html
16.48
KB
-rw-r--r--
2023-12-18 11:36
cmath.html
33.37
KB
-rw-r--r--
2023-12-18 11:36
cmd.html
42.78
KB
-rw-r--r--
2023-12-18 11:36
code.html
27.23
KB
-rw-r--r--
2023-12-18 11:36
codecs.html
130.93
KB
-rw-r--r--
2023-12-18 11:36
codeop.html
13.97
KB
-rw-r--r--
2023-12-18 11:36
collections.abc.html
59.48
KB
-rw-r--r--
2023-12-18 11:36
collections.html
151.31
KB
-rw-r--r--
2023-12-18 11:36
colorsys.html
12.33
KB
-rw-r--r--
2023-12-18 11:36
compileall.html
27.6
KB
-rw-r--r--
2023-12-18 11:36
concurrency.html
20.71
KB
-rw-r--r--
2023-12-18 11:36
concurrent.futures.html
59.24
KB
-rw-r--r--
2023-12-18 11:36
concurrent.html
7.77
KB
-rw-r--r--
2023-12-18 11:36
configparser.html
137.75
KB
-rw-r--r--
2023-12-18 11:36
constants.html
17.09
KB
-rw-r--r--
2023-12-18 11:36
contextlib.html
86.72
KB
-rw-r--r--
2023-12-18 11:36
copy.html
13.52
KB
-rw-r--r--
2023-12-18 11:36
copyreg.html
14.38
KB
-rw-r--r--
2023-12-18 11:36
crypt.html
19.85
KB
-rw-r--r--
2023-12-18 11:36
crypto.html
10.66
KB
-rw-r--r--
2023-12-18 11:36
csv.html
67.42
KB
-rw-r--r--
2023-12-18 11:36
ctypes.html
258.33
KB
-rw-r--r--
2023-12-18 11:36
curses.ascii.html
24.61
KB
-rw-r--r--
2023-12-18 11:36
curses.html
171.44
KB
-rw-r--r--
2023-12-18 11:36
curses.panel.html
16.31
KB
-rw-r--r--
2023-12-18 11:36
custominterp.html
8.53
KB
-rw-r--r--
2023-12-18 11:36
datatypes.html
23.39
KB
-rw-r--r--
2023-12-18 11:36
datetime.html
299.25
KB
-rw-r--r--
2023-12-18 11:36
dbm.html
42.11
KB
-rw-r--r--
2023-12-18 11:36
debug.html
13.66
KB
-rw-r--r--
2023-12-18 11:36
decimal.html
228.01
KB
-rw-r--r--
2023-12-18 11:36
development.html
24.53
KB
-rw-r--r--
2023-12-18 11:36
difflib.html
93.9
KB
-rw-r--r--
2023-12-18 11:36
dis.html
103.7
KB
-rw-r--r--
2023-12-18 11:36
distribution.html
10.26
KB
-rw-r--r--
2023-12-18 11:36
distutils.html
10.63
KB
-rw-r--r--
2023-12-18 11:36
doctest.html
175.54
KB
-rw-r--r--
2023-12-18 11:36
dummy_threading.html
9.1
KB
-rw-r--r--
2023-12-18 11:36
email.charset.html
25.81
KB
-rw-r--r--
2023-12-18 11:36
email.compat32-message.html
84.13
KB
-rw-r--r--
2023-12-18 11:36
email.contentmanager.html
29.32
KB
-rw-r--r--
2023-12-18 11:36
email.encoders.html
13.92
KB
-rw-r--r--
2023-12-18 11:36
email.errors.html
19.24
KB
-rw-r--r--
2023-12-18 11:36
email.examples.html
56.52
KB
-rw-r--r--
2023-12-18 11:36
email.generator.html
40.82
KB
-rw-r--r--
2023-12-18 11:36
email.header.html
30.49
KB
-rw-r--r--
2023-12-18 11:36
email.headerregistry.html
56.32
KB
-rw-r--r--
2023-12-18 11:36
email.html
27.09
KB
-rw-r--r--
2023-12-18 11:36
email.iterators.html
13.21
KB
-rw-r--r--
2023-12-18 11:36
email.message.html
85.17
KB
-rw-r--r--
2023-12-18 11:36
email.mime.html
35.24
KB
-rw-r--r--
2023-12-18 11:36
email.parser.html
46.32
KB
-rw-r--r--
2023-12-18 11:36
email.policy.html
73.48
KB
-rw-r--r--
2023-12-18 11:36
email.util.html
33.06
KB
-rw-r--r--
2023-12-18 11:36
ensurepip.html
18.26
KB
-rw-r--r--
2023-12-18 11:36
enum.html
130.81
KB
-rw-r--r--
2023-12-18 11:36
errno.html
40.36
KB
-rw-r--r--
2023-12-18 11:36
exceptions.html
83.16
KB
-rw-r--r--
2023-12-18 11:36
faulthandler.html
22.85
KB
-rw-r--r--
2023-12-18 11:36
fcntl.html
26.68
KB
-rw-r--r--
2023-12-18 11:36
filecmp.html
24.45
KB
-rw-r--r--
2023-12-18 11:36
fileformats.html
10.87
KB
-rw-r--r--
2023-12-18 11:36
fileinput.html
29.33
KB
-rw-r--r--
2023-12-18 11:36
filesys.html
13.1
KB
-rw-r--r--
2023-12-18 11:36
fnmatch.html
16.59
KB
-rw-r--r--
2023-12-18 11:36
formatter.html
36.78
KB
-rw-r--r--
2023-12-18 11:36
fpectl.html
17.13
KB
-rw-r--r--
2023-12-18 11:36
fractions.html
29.22
KB
-rw-r--r--
2023-12-18 11:36
frameworks.html
13.16
KB
-rw-r--r--
2023-12-18 11:36
ftplib.html
53.15
KB
-rw-r--r--
2023-12-18 11:36
functional.html
8.79
KB
-rw-r--r--
2023-12-18 11:36
functions.html
196.76
KB
-rw-r--r--
2023-12-18 11:36
functools.html
63.43
KB
-rw-r--r--
2023-12-18 11:36
gc.html
28.83
KB
-rw-r--r--
2023-12-18 11:36
getopt.html
24.76
KB
-rw-r--r--
2023-12-18 11:36
getpass.html
11.78
KB
-rw-r--r--
2023-12-18 11:36
gettext.html
74.84
KB
-rw-r--r--
2023-12-18 11:36
glob.html
18
KB
-rw-r--r--
2023-12-18 11:36
grp.html
12.09
KB
-rw-r--r--
2023-12-18 11:36
gzip.html
31.9
KB
-rw-r--r--
2023-12-18 11:36
hashlib.html
77.69
KB
-rw-r--r--
2023-12-18 11:36
heapq.html
34.7
KB
-rw-r--r--
2023-12-18 11:36
hmac.html
17.41
KB
-rw-r--r--
2023-12-18 11:36
html.entities.html
11.09
KB
-rw-r--r--
2023-12-18 11:36
html.html
10.85
KB
-rw-r--r--
2023-12-18 11:36
html.parser.html
40.86
KB
-rw-r--r--
2023-12-18 11:36
http.client.html
63.72
KB
-rw-r--r--
2023-12-18 11:36
http.cookiejar.html
93.94
KB
-rw-r--r--
2023-12-18 11:36
http.cookies.html
38.41
KB
-rw-r--r--
2023-12-18 11:36
http.html
36.72
KB
-rw-r--r--
2023-12-18 11:36
http.server.html
56.83
KB
-rw-r--r--
2023-12-18 11:36
i18n.html
10.22
KB
-rw-r--r--
2023-12-18 11:36
idle.html
47.28
KB
-rw-r--r--
2023-12-18 11:36
imaplib.html
65.76
KB
-rw-r--r--
2023-12-18 11:36
imghdr.html
13.14
KB
-rw-r--r--
2023-12-18 11:36
imp.html
47.02
KB
-rw-r--r--
2023-12-18 11:36
importlib.html
169.05
KB
-rw-r--r--
2023-12-18 11:36
index.html
66.18
KB
-rw-r--r--
2023-12-18 11:36
inspect.html
127.3
KB
-rw-r--r--
2023-12-18 11:36
internet.html
30.36
KB
-rw-r--r--
2023-12-18 11:36
intro.html
9.67
KB
-rw-r--r--
2023-12-18 11:36
io.html
119.81
KB
-rw-r--r--
2023-12-18 11:36
ipaddress.html
103.39
KB
-rw-r--r--
2023-12-18 11:36
ipc.html
32.95
KB
-rw-r--r--
2023-12-18 11:36
itertools.html
129.71
KB
-rw-r--r--
2023-12-18 11:36
json.html
79.18
KB
-rw-r--r--
2023-12-18 11:36
keyword.html
8.71
KB
-rw-r--r--
2023-12-18 11:36
language.html
13.33
KB
-rw-r--r--
2023-12-18 11:36
linecache.html
13.18
KB
-rw-r--r--
2023-12-18 11:36
locale.html
60.1
KB
-rw-r--r--
2023-12-18 11:36
logging.config.html
83.49
KB
-rw-r--r--
2023-12-18 11:36
logging.handlers.html
109.76
KB
-rw-r--r--
2023-12-18 11:36
logging.html
131.69
KB
-rw-r--r--
2023-12-18 11:36
lzma.html
55.16
KB
-rw-r--r--
2023-12-18 11:36
macpath.html
9.04
KB
-rw-r--r--
2023-12-18 11:36
mailbox.html
153.63
KB
-rw-r--r--
2023-12-18 11:36
mailcap.html
14.33
KB
-rw-r--r--
2023-12-18 11:36
markup.html
18.9
KB
-rw-r--r--
2023-12-18 11:36
marshal.html
17.89
KB
-rw-r--r--
2023-12-18 11:36
math.html
52.4
KB
-rw-r--r--
2023-12-18 11:36
mimetypes.html
30.67
KB
-rw-r--r--
2023-12-18 11:36
misc.html
7.93
KB
-rw-r--r--
2023-12-18 11:36
mm.html
9.79
KB
-rw-r--r--
2023-12-18 11:36
mmap.html
33.49
KB
-rw-r--r--
2023-12-18 11:36
modulefinder.html
18.12
KB
-rw-r--r--
2023-12-18 11:36
modules.html
10.66
KB
-rw-r--r--
2023-12-18 11:36
msilib.html
55.86
KB
-rw-r--r--
2023-12-18 11:36
msvcrt.html
21.47
KB
-rw-r--r--
2023-12-18 11:36
multiprocessing.html
356.92
KB
-rw-r--r--
2023-12-18 11:36
netdata.html
17.06
KB
-rw-r--r--
2023-12-18 11:36
netrc.html
14.23
KB
-rw-r--r--
2023-12-18 11:36
nis.html
11.39
KB
-rw-r--r--
2023-12-18 11:36
nntplib.html
67.97
KB
-rw-r--r--
2023-12-18 11:36
numbers.html
40.46
KB
-rw-r--r--
2023-12-18 11:36
numeric.html
15.17
KB
-rw-r--r--
2023-12-18 11:36
operator.html
79.55
KB
-rw-r--r--
2023-12-18 11:36
optparse.html
244.08
KB
-rw-r--r--
2023-12-18 11:36
os.html
388.71
KB
-rw-r--r--
2023-12-18 11:36
os.path.html
52.56
KB
-rw-r--r--
2023-12-18 11:36
ossaudiodev.html
46.82
KB
-rw-r--r--
2023-12-18 11:36
othergui.html
10.02
KB
-rw-r--r--
2023-12-18 11:36
parser.html
41.41
KB
-rw-r--r--
2023-12-18 11:36
pathlib.html
113.99
KB
-rw-r--r--
2023-12-18 11:36
pdb.html
51.43
KB
-rw-r--r--
2023-12-18 11:36
persistence.html
14.92
KB
-rw-r--r--
2023-12-18 11:36
pickle.html
112.36
KB
-rw-r--r--
2023-12-18 11:36
pickletools.html
16.69
KB
-rw-r--r--
2023-12-18 11:36
pipes.html
15.62
KB
-rw-r--r--
2023-12-18 11:36
pkgutil.html
31.13
KB
-rw-r--r--
2023-12-18 11:36
platform.html
32.94
KB
-rw-r--r--
2023-12-18 11:36
plistlib.html
28.6
KB
-rw-r--r--
2023-12-18 11:36
poplib.html
30.21
KB
-rw-r--r--
2023-12-18 11:36
posix.html
17.2
KB
-rw-r--r--
2023-12-18 11:36
pprint.html
40.99
KB
-rw-r--r--
2023-12-18 11:36
profile.html
70.16
KB
-rw-r--r--
2023-12-18 11:36
pty.html
17.18
KB
-rw-r--r--
2023-12-18 11:36
pwd.html
12.79
KB
-rw-r--r--
2023-12-18 11:36
py_compile.html
15.14
KB
-rw-r--r--
2023-12-18 11:36
pyclbr.html
16.13
KB
-rw-r--r--
2023-12-18 11:36
pydoc.html
15.62
KB
-rw-r--r--
2023-12-18 11:36
pyexpat.html
86.85
KB
-rw-r--r--
2023-12-18 11:36
python.html
16.73
KB
-rw-r--r--
2023-12-18 11:36
queue.html
27.54
KB
-rw-r--r--
2023-12-18 11:36
quopri.html
13.53
KB
-rw-r--r--
2023-12-18 11:36
random.html
59.22
KB
-rw-r--r--
2023-12-18 11:36
re.html
186.7
KB
-rw-r--r--
2023-12-18 11:36
readline.html
41.15
KB
-rw-r--r--
2023-12-18 11:36
reprlib.html
24.38
KB
-rw-r--r--
2023-12-18 11:36
resource.html
35.7
KB
-rw-r--r--
2023-12-18 11:36
rlcompleter.html
14.05
KB
-rw-r--r--
2023-12-18 11:36
runpy.html
25.98
KB
-rw-r--r--
2023-12-18 11:36
sched.html
19.56
KB
-rw-r--r--
2023-12-18 11:36
secrets.html
24.15
KB
-rw-r--r--
2023-12-18 11:36
select.html
61.35
KB
-rw-r--r--
2023-12-18 11:36
selectors.html
35
KB
-rw-r--r--
2023-12-18 11:36
shelve.html
28.1
KB
-rw-r--r--
2023-12-18 11:36
shlex.html
47.83
KB
-rw-r--r--
2023-12-18 11:36
shutil.html
72.47
KB
-rw-r--r--
2023-12-18 11:36
signal.html
53.77
KB
-rw-r--r--
2023-12-18 11:36
site.html
31.49
KB
-rw-r--r--
2023-12-18 11:36
smtpd.html
35.05
KB
-rw-r--r--
2023-12-18 11:36
smtplib.html
66.83
KB
-rw-r--r--
2023-12-18 11:36
sndhdr.html
12.15
KB
-rw-r--r--
2023-12-18 11:36
socket.html
191.48
KB
-rw-r--r--
2023-12-18 11:36
socketserver.html
80
KB
-rw-r--r--
2023-12-18 11:36
spwd.html
12.04
KB
-rw-r--r--
2023-12-18 11:36
sqlite3.html
158.08
KB
-rw-r--r--
2023-12-18 11:36
ssl.html
260.08
KB
-rw-r--r--
2023-12-18 11:36
stat.html
43.67
KB
-rw-r--r--
2023-12-18 11:36
statistics.html
48.88
KB
-rw-r--r--
2023-12-18 11:36
stdtypes.html
454.74
KB
-rw-r--r--
2023-12-18 11:36
string.html
93.03
KB
-rw-r--r--
2023-12-18 11:36
stringprep.html
18.22
KB
-rw-r--r--
2023-12-18 11:36
struct.html
49.9
KB
-rw-r--r--
2023-12-18 11:36
subprocess.html
138.6
KB
-rw-r--r--
2023-12-18 11:36
sunau.html
31.01
KB
-rw-r--r--
2023-12-18 11:36
superseded.html
13.46
KB
-rw-r--r--
2023-12-18 11:36
symbol.html
8.64
KB
-rw-r--r--
2023-12-18 11:36
symtable.html
25.5
KB
-rw-r--r--
2023-12-18 11:36
sys.html
138.35
KB
-rw-r--r--
2023-12-18 11:36
sysconfig.html
29.55
KB
-rw-r--r--
2023-12-18 11:36
syslog.html
20.53
KB
-rw-r--r--
2023-12-18 11:36
tabnanny.html
11.98
KB
-rw-r--r--
2023-12-18 11:36
tarfile.html
94.49
KB
-rw-r--r--
2023-12-18 11:36
telnetlib.html
29.7
KB
-rw-r--r--
2023-12-18 11:36
tempfile.html
40.42
KB
-rw-r--r--
2023-12-18 11:36
termios.html
17.75
KB
-rw-r--r--
2023-12-18 11:36
test.html
76.71
KB
-rw-r--r--
2023-12-18 11:36
text.html
13.46
KB
-rw-r--r--
2023-12-18 11:36
textwrap.html
37.11
KB
-rw-r--r--
2023-12-18 11:36
threading.html
101.04
KB
-rw-r--r--
2023-12-18 11:36
time.html
77.76
KB
-rw-r--r--
2023-12-18 11:36
timeit.html
44.19
KB
-rw-r--r--
2023-12-18 11:36
tk.html
22.75
KB
-rw-r--r--
2023-12-18 11:36
tkinter.html
80.99
KB
-rw-r--r--
2023-12-18 11:36
tkinter.scrolledtext.html
9.72
KB
-rw-r--r--
2023-12-18 11:36
tkinter.tix.html
50.64
KB
-rw-r--r--
2023-12-18 11:36
tkinter.ttk.html
108.08
KB
-rw-r--r--
2023-12-18 11:36
token.html
22.13
KB
-rw-r--r--
2023-12-18 11:36
tokenize.html
31.4
KB
-rw-r--r--
2023-12-18 11:36
trace.html
28.46
KB
-rw-r--r--
2023-12-18 11:36
traceback.html
56.24
KB
-rw-r--r--
2023-12-18 11:36
tracemalloc.html
98.77
KB
-rw-r--r--
2023-12-18 11:36
tty.html
10.29
KB
-rw-r--r--
2023-12-18 11:36
turtle.html
244.5
KB
-rw-r--r--
2023-12-18 11:36
types.html
36.19
KB
-rw-r--r--
2023-12-18 11:36
typing.html
135.91
KB
-rw-r--r--
2023-12-18 11:36
undoc.html
8.97
KB
-rw-r--r--
2023-12-18 11:36
unicodedata.html
20.61
KB
-rw-r--r--
2023-12-18 11:36
unittest.html
244.81
KB
-rw-r--r--
2023-12-18 11:36
unittest.mock-examples.html
164.2
KB
-rw-r--r--
2023-12-18 11:36
unittest.mock.html
293.06
KB
-rw-r--r--
2023-12-18 11:36
unix.html
11.5
KB
-rw-r--r--
2023-12-18 11:36
urllib.error.html
14.13
KB
-rw-r--r--
2023-12-18 11:36
urllib.html
9.34
KB
-rw-r--r--
2023-12-18 11:36
urllib.parse.html
74.54
KB
-rw-r--r--
2023-12-18 11:36
urllib.request.html
173.05
KB
-rw-r--r--
2023-12-18 11:36
urllib.robotparser.html
16.75
KB
-rw-r--r--
2023-12-18 11:36
uu.html
11.92
KB
-rw-r--r--
2023-12-18 11:36
uuid.html
31.21
KB
-rw-r--r--
2023-12-18 11:36
venv.html
72.18
KB
-rw-r--r--
2023-12-18 11:36
warnings.html
49.14
KB
-rw-r--r--
2023-12-18 11:36
wave.html
29.17
KB
-rw-r--r--
2023-12-18 11:36
weakref.html
63.76
KB
-rw-r--r--
2023-12-18 11:36
webbrowser.html
26.27
KB
-rw-r--r--
2023-12-18 11:36
windows.html
10.38
KB
-rw-r--r--
2023-12-18 11:36
winreg.html
65.17
KB
-rw-r--r--
2023-12-18 11:36
winsound.html
20.77
KB
-rw-r--r--
2023-12-18 11:36
wsgiref.html
92.28
KB
-rw-r--r--
2023-12-18 11:36
xdrlib.html
32.96
KB
-rw-r--r--
2023-12-18 11:36
xml.dom.html
95.28
KB
-rw-r--r--
2023-12-18 11:36
xml.dom.minidom.html
40.51
KB
-rw-r--r--
2023-12-18 11:36
xml.dom.pulldom.html
23.65
KB
-rw-r--r--
2023-12-18 11:36
xml.etree.elementtree.html
132.32
KB
-rw-r--r--
2023-12-18 11:36
xml.html
18.81
KB
-rw-r--r--
2023-12-18 11:36
xml.sax.handler.html
41.66
KB
-rw-r--r--
2023-12-18 11:36
xml.sax.html
24.92
KB
-rw-r--r--
2023-12-18 11:36
xml.sax.reader.html
44.79
KB
-rw-r--r--
2023-12-18 11:36
xml.sax.utils.html
16.53
KB
-rw-r--r--
2023-12-18 11:36
xmlrpc.client.html
70.26
KB
-rw-r--r--
2023-12-18 11:36
xmlrpc.html
8.33
KB
-rw-r--r--
2023-12-18 11:36
xmlrpc.server.html
48.04
KB
-rw-r--r--
2023-12-18 11:36
zipapp.html
44.05
KB
-rw-r--r--
2023-12-18 11:36
zipfile.html
78.16
KB
-rw-r--r--
2023-12-18 11:36
zipimport.html
22.51
KB
-rw-r--r--
2023-12-18 11:36
zlib.html
33.75
KB
-rw-r--r--
2023-12-18 11:36
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.6. bisect — Array bisection algorithm — Python 3.6.7 documentation</title> <link rel="stylesheet" href="../_static/pydoctheme.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 3.6.7 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.7. array — Efficient arrays of numeric values" href="array.html" /> <link rel="prev" title="8.5. 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/3/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.7. array — Efficient arrays of numeric values" accesskey="N">next</a> |</li> <li class="right" > <a href="heapq.html" title="8.5. 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">3.6.7 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> <li class="right"> <div class="inline-search" style="display: none" role="search"> <form class="inline-search" action="../search.html" method="get"> <input placeholder="Quick search" 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> <script type="text/javascript">$('.inline-search').show(0);</script> | </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.6. <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> <p><strong>Source code:</strong> <a class="reference external" href="https://github.com/python/cpython/tree/3.6/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.6.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-python3 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.6.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-python3 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="gp">... </span> <span class="n">i</span> <span class="o">=</span> <span class="n">bisect</span><span class="p">(</span><span class="n">breakpoints</span><span class="p">,</span> <span class="n">score</span><span class="p">)</span> <span class="gp">... </span> <span class="k">return</span> <span class="n">grades</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="gp">...</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-python3 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.6. <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.6.1. Searching Sorted Lists</a></li> <li><a class="reference internal" href="#other-examples">8.6.2. Other Examples</a></li> </ul> </li> </ul> <h4>Previous topic</h4> <p class="topless"><a href="heapq.html" title="previous chapter">8.5. <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.7. <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="../bugs.html">Report a Bug</a></li> <li> <a href="https://github.com/python/cpython/blob/3.6/Doc/library/bisect.rst" rel="nofollow">Show Source </a> </li> </ul> </div> </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.7. array — Efficient arrays of numeric values" >next</a> |</li> <li class="right" > <a href="heapq.html" title="8.5. 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">3.6.7 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> <li class="right"> <div class="inline-search" style="display: none" role="search"> <form class="inline-search" action="../search.html" method="get"> <input placeholder="Quick search" 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> <script type="text/javascript">$('.inline-search').show(0);</script> | </li> </ul> </div> <div class="footer"> © <a href="../copyright.html">Copyright</a> 2001-2023, 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 Dec 18, 2023. <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>