Linux vmi2545633.contaboserver.net 6.1.0-32-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.129-1 (2025-03-06) x86_64
Apache/2.4.62 (Debian)
Server IP : 127.0.0.1 & Your IP : 127.0.0.1
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
lib /
python3.11 /
__pycache__ /
Delete
Unzip
Name
Size
Permission
Date
Action
__future__.cpython-311.pyc
4.8
KB
-rw-r--r--
2025-04-07 20:15
__hello__.cpython-311.pyc
1.05
KB
-rw-r--r--
2025-04-07 20:15
_aix_support.cpython-311.pyc
4.26
KB
-rw-r--r--
2025-04-07 20:15
_bootsubprocess.cpython-311.pyc
4.35
KB
-rw-r--r--
2025-04-07 20:15
_collections_abc.cpython-311.pyc
50.01
KB
-rw-r--r--
2025-04-07 20:15
_compat_pickle.cpython-311.pyc
7.34
KB
-rw-r--r--
2025-04-07 20:15
_compression.cpython-311.pyc
7.86
KB
-rw-r--r--
2025-04-07 20:15
_distutils_system_mod.cpython-311.pyc
9.08
KB
-rw-r--r--
2025-04-07 20:15
_markupbase.cpython-311.pyc
13.75
KB
-rw-r--r--
2025-04-07 20:15
_osx_support.cpython-311.pyc
19.4
KB
-rw-r--r--
2025-04-07 20:15
_py_abc.cpython-311.pyc
7.69
KB
-rw-r--r--
2025-04-07 20:15
_pydecimal.cpython-311.pyc
238.53
KB
-rw-r--r--
2025-04-07 20:15
_pyio.cpython-311.pyc
117.23
KB
-rw-r--r--
2025-04-07 20:15
_sitebuiltins.cpython-311.pyc
5.29
KB
-rw-r--r--
2025-04-07 20:15
_strptime.cpython-311.pyc
27.27
KB
-rw-r--r--
2025-04-07 20:15
_sysconfigdata__linux_x86_64-linux-gnu.cpython-311.pyc
53.26
KB
-rw-r--r--
2025-04-07 20:15
_sysconfigdata__x86_64-linux-gnu.cpython-311.pyc
53.25
KB
-rw-r--r--
2025-04-07 20:15
_threading_local.cpython-311.pyc
8.99
KB
-rw-r--r--
2025-04-07 20:15
_weakrefset.cpython-311.pyc
12.83
KB
-rw-r--r--
2025-04-07 20:15
abc.cpython-311.pyc
8.81
KB
-rw-r--r--
2025-04-07 20:15
aifc.cpython-311.pyc
44.44
KB
-rw-r--r--
2025-04-07 20:15
antigravity.cpython-311.pyc
1.22
KB
-rw-r--r--
2025-04-07 20:15
argparse.cpython-311.pyc
111
KB
-rw-r--r--
2025-04-07 20:15
ast.cpython-311.pyc
106.42
KB
-rw-r--r--
2025-04-07 20:15
asynchat.cpython-311.pyc
11.61
KB
-rw-r--r--
2025-04-07 20:15
asyncore.cpython-311.pyc
27.53
KB
-rw-r--r--
2025-04-07 20:15
base64.cpython-311.pyc
27.78
KB
-rw-r--r--
2025-04-07 20:15
bdb.cpython-311.pyc
37.69
KB
-rw-r--r--
2025-04-07 20:15
bisect.cpython-311.pyc
3.61
KB
-rw-r--r--
2025-04-07 20:15
bz2.cpython-311.pyc
15.78
KB
-rw-r--r--
2025-04-07 20:15
cProfile.cpython-311.pyc
8.82
KB
-rw-r--r--
2025-04-07 20:15
calendar.cpython-311.pyc
43.7
KB
-rw-r--r--
2025-04-07 20:15
cgi.cpython-311.pyc
42.83
KB
-rw-r--r--
2025-04-07 20:15
cgitb.cpython-311.pyc
18.44
KB
-rw-r--r--
2025-04-07 20:15
chunk.cpython-311.pyc
7.25
KB
-rw-r--r--
2025-04-07 20:15
cmd.cpython-311.pyc
20.11
KB
-rw-r--r--
2025-04-07 20:15
code.cpython-311.pyc
13.57
KB
-rw-r--r--
2025-04-07 20:15
codecs.cpython-311.pyc
43.33
KB
-rw-r--r--
2025-04-07 20:15
codeop.cpython-311.pyc
7.25
KB
-rw-r--r--
2025-04-07 20:15
colorsys.cpython-311.pyc
4.82
KB
-rw-r--r--
2025-04-07 20:15
compileall.cpython-311.pyc
21.08
KB
-rw-r--r--
2025-04-07 20:15
configparser.cpython-311.pyc
70.01
KB
-rw-r--r--
2025-04-07 20:15
contextlib.cpython-311.pyc
31.85
KB
-rw-r--r--
2025-04-07 20:15
contextvars.cpython-311.pyc
297
B
-rw-r--r--
2025-04-07 20:15
copy.cpython-311.pyc
10.92
KB
-rw-r--r--
2025-04-07 20:15
copyreg.cpython-311.pyc
7.99
KB
-rw-r--r--
2025-04-07 20:15
crypt.cpython-311.pyc
5.7
KB
-rw-r--r--
2025-04-07 20:15
csv.cpython-311.pyc
19.58
KB
-rw-r--r--
2025-04-07 20:15
dataclasses.cpython-311.pyc
45.81
KB
-rw-r--r--
2025-04-07 20:15
datetime.cpython-311.pyc
99.13
KB
-rw-r--r--
2025-04-07 20:15
decimal.cpython-311.pyc
541
B
-rw-r--r--
2025-04-07 20:15
difflib.cpython-311.pyc
79.73
KB
-rw-r--r--
2025-04-07 20:15
dis.cpython-311.pyc
35.86
KB
-rw-r--r--
2025-04-07 20:15
doctest.cpython-311.pyc
109.21
KB
-rw-r--r--
2025-04-07 20:15
enum.cpython-311.pyc
84.42
KB
-rw-r--r--
2025-04-07 20:15
filecmp.cpython-311.pyc
15.34
KB
-rw-r--r--
2025-04-07 20:15
fileinput.cpython-311.pyc
20.65
KB
-rw-r--r--
2025-04-07 20:15
fnmatch.cpython-311.pyc
7.29
KB
-rw-r--r--
2025-04-07 20:15
fractions.cpython-311.pyc
28.55
KB
-rw-r--r--
2025-04-07 20:15
ftplib.cpython-311.pyc
46.06
KB
-rw-r--r--
2025-04-07 20:15
functools.cpython-311.pyc
45.54
KB
-rw-r--r--
2025-04-07 20:15
genericpath.cpython-311.pyc
6.01
KB
-rw-r--r--
2025-04-07 20:15
getopt.cpython-311.pyc
9.5
KB
-rw-r--r--
2025-04-07 20:15
getpass.cpython-311.pyc
7.33
KB
-rw-r--r--
2025-04-07 20:15
gettext.cpython-311.pyc
23.25
KB
-rw-r--r--
2025-04-07 20:15
glob.cpython-311.pyc
10.88
KB
-rw-r--r--
2025-04-07 20:15
graphlib.cpython-311.pyc
10.81
KB
-rw-r--r--
2025-04-07 20:15
gzip.cpython-311.pyc
32.93
KB
-rw-r--r--
2025-04-07 20:15
hashlib.cpython-311.pyc
12.05
KB
-rw-r--r--
2025-04-07 20:15
heapq.cpython-311.pyc
20.09
KB
-rw-r--r--
2025-04-07 20:15
hmac.cpython-311.pyc
11.2
KB
-rw-r--r--
2025-04-07 20:15
imaplib.cpython-311.pyc
66.99
KB
-rw-r--r--
2025-04-07 20:15
imghdr.cpython-311.pyc
7.66
KB
-rw-r--r--
2025-04-07 20:15
imp.cpython-311.pyc
16.07
KB
-rw-r--r--
2025-04-07 20:15
inspect.cpython-311.pyc
138.47
KB
-rw-r--r--
2025-04-07 20:15
io.cpython-311.pyc
4.9
KB
-rw-r--r--
2025-04-07 20:15
ipaddress.cpython-311.pyc
93.95
KB
-rw-r--r--
2025-04-07 20:15
keyword.cpython-311.pyc
1.04
KB
-rw-r--r--
2025-04-07 20:15
linecache.cpython-311.pyc
7.29
KB
-rw-r--r--
2025-04-07 20:15
locale.cpython-311.pyc
62.77
KB
-rw-r--r--
2025-04-07 20:15
lzma.cpython-311.pyc
16.33
KB
-rw-r--r--
2025-04-07 20:15
mailbox.cpython-311.pyc
121.61
KB
-rw-r--r--
2025-04-07 20:15
mailcap.cpython-311.pyc
12.48
KB
-rw-r--r--
2025-04-07 20:15
mimetypes.cpython-311.pyc
25.25
KB
-rw-r--r--
2025-04-07 20:15
modulefinder.cpython-311.pyc
30.29
KB
-rw-r--r--
2025-04-07 20:15
netrc.cpython-311.pyc
9.66
KB
-rw-r--r--
2025-04-07 20:15
nntplib.cpython-311.pyc
48.98
KB
-rw-r--r--
2025-04-07 20:15
ntpath.cpython-311.pyc
29.55
KB
-rw-r--r--
2025-04-07 20:15
nturl2path.cpython-311.pyc
3.41
KB
-rw-r--r--
2025-04-07 20:15
numbers.cpython-311.pyc
14.89
KB
-rw-r--r--
2025-04-07 20:15
opcode.cpython-311.pyc
13.53
KB
-rw-r--r--
2025-04-07 20:15
operator.cpython-311.pyc
18.32
KB
-rw-r--r--
2025-04-07 20:15
optparse.cpython-311.pyc
71.99
KB
-rw-r--r--
2025-04-07 20:15
os.cpython-311.pyc
47.82
KB
-rw-r--r--
2025-04-07 20:15
pathlib.cpython-311.pyc
66.18
KB
-rw-r--r--
2025-04-07 20:15
pdb.cpython-311.pyc
83.55
KB
-rw-r--r--
2025-04-07 20:15
pickle.cpython-311.pyc
84.6
KB
-rw-r--r--
2025-04-07 20:15
pickletools.cpython-311.pyc
84.25
KB
-rw-r--r--
2025-04-07 20:15
pipes.cpython-311.pyc
11.69
KB
-rw-r--r--
2025-04-07 20:15
pkgutil.cpython-311.pyc
30.82
KB
-rw-r--r--
2025-04-07 20:15
platform.cpython-311.pyc
42.7
KB
-rw-r--r--
2025-04-07 20:15
plistlib.cpython-311.pyc
44.76
KB
-rw-r--r--
2025-04-07 20:15
poplib.cpython-311.pyc
20.48
KB
-rw-r--r--
2025-04-07 20:15
posixpath.cpython-311.pyc
19.51
KB
-rw-r--r--
2025-04-07 20:15
pprint.cpython-311.pyc
32.69
KB
-rw-r--r--
2025-04-07 20:15
profile.cpython-311.pyc
23.35
KB
-rw-r--r--
2025-04-07 20:15
pstats.cpython-311.pyc
40.89
KB
-rw-r--r--
2025-04-07 20:15
pty.cpython-311.pyc
7.34
KB
-rw-r--r--
2025-04-07 20:15
py_compile.cpython-311.pyc
10.59
KB
-rw-r--r--
2025-04-07 20:15
pyclbr.cpython-311.pyc
15.51
KB
-rw-r--r--
2025-04-07 20:15
pydoc.cpython-311.pyc
151.22
KB
-rw-r--r--
2025-04-07 20:15
queue.cpython-311.pyc
16.07
KB
-rw-r--r--
2025-04-07 20:15
quopri.cpython-311.pyc
10.6
KB
-rw-r--r--
2025-04-07 20:15
random.cpython-311.pyc
33.71
KB
-rw-r--r--
2025-04-07 20:15
reprlib.cpython-311.pyc
9.45
KB
-rw-r--r--
2025-04-07 20:15
rlcompleter.cpython-311.pyc
8.8
KB
-rw-r--r--
2025-04-07 20:15
runpy.cpython-311.pyc
15.74
KB
-rw-r--r--
2025-04-07 20:15
sched.cpython-311.pyc
8.21
KB
-rw-r--r--
2025-04-07 20:15
secrets.cpython-311.pyc
2.79
KB
-rw-r--r--
2025-04-07 20:15
selectors.cpython-311.pyc
27.68
KB
-rw-r--r--
2025-04-07 20:15
shelve.cpython-311.pyc
13.55
KB
-rw-r--r--
2025-04-07 20:15
shlex.cpython-311.pyc
14.36
KB
-rw-r--r--
2025-04-07 20:15
shutil.cpython-311.pyc
68.81
KB
-rw-r--r--
2025-04-07 20:15
signal.cpython-311.pyc
4.9
KB
-rw-r--r--
2025-04-07 20:15
site.cpython-311.pyc
30.24
KB
-rw-r--r--
2025-04-07 20:15
sitecustomize.cpython-311.pyc
334
B
-rw-r--r--
2025-04-07 20:15
smtpd.cpython-311.pyc
42.64
KB
-rw-r--r--
2025-04-07 20:15
smtplib.cpython-311.pyc
52.85
KB
-rw-r--r--
2025-04-07 20:15
sndhdr.cpython-311.pyc
12.13
KB
-rw-r--r--
2025-04-07 20:15
socket.cpython-311.pyc
44.41
KB
-rw-r--r--
2025-04-07 20:15
socketserver.cpython-311.pyc
36.19
KB
-rw-r--r--
2025-04-07 20:15
sre_compile.cpython-311.pyc
813
B
-rw-r--r--
2025-04-07 20:15
sre_constants.cpython-311.pyc
816
B
-rw-r--r--
2025-04-07 20:15
sre_parse.cpython-311.pyc
809
B
-rw-r--r--
2025-04-07 20:15
ssl.cpython-311.pyc
71.75
KB
-rw-r--r--
2025-04-07 20:15
stat.cpython-311.pyc
5.41
KB
-rw-r--r--
2025-04-07 20:15
statistics.cpython-311.pyc
57.03
KB
-rw-r--r--
2025-04-07 20:15
string.cpython-311.pyc
12.34
KB
-rw-r--r--
2025-04-07 20:15
stringprep.cpython-311.pyc
25.91
KB
-rw-r--r--
2025-04-07 20:15
struct.cpython-311.pyc
380
B
-rw-r--r--
2025-04-07 20:15
subprocess.cpython-311.pyc
80.22
KB
-rw-r--r--
2025-04-07 20:15
sunau.cpython-311.pyc
26.37
KB
-rw-r--r--
2025-04-07 20:15
symtable.cpython-311.pyc
19.05
KB
-rw-r--r--
2025-04-07 20:15
sysconfig.cpython-311.pyc
31.9
KB
-rw-r--r--
2025-04-07 20:15
tabnanny.cpython-311.pyc
12.64
KB
-rw-r--r--
2025-04-07 20:15
tarfile.cpython-311.pyc
115.84
KB
-rw-r--r--
2025-04-07 20:15
telnetlib.cpython-311.pyc
30.35
KB
-rw-r--r--
2025-04-07 20:15
tempfile.cpython-311.pyc
47.39
KB
-rw-r--r--
2025-04-07 20:15
textwrap.cpython-311.pyc
19.14
KB
-rw-r--r--
2025-04-07 20:15
this.cpython-311.pyc
1.56
KB
-rw-r--r--
2025-04-07 20:15
threading.cpython-311.pyc
68.2
KB
-rw-r--r--
2025-04-07 20:15
timeit.cpython-311.pyc
16.05
KB
-rw-r--r--
2025-04-07 20:15
token.cpython-311.pyc
3.64
KB
-rw-r--r--
2025-04-07 20:15
tokenize.cpython-311.pyc
29.65
KB
-rw-r--r--
2025-04-07 20:15
trace.cpython-311.pyc
35.15
KB
-rw-r--r--
2025-04-07 20:15
traceback.cpython-311.pyc
44.85
KB
-rw-r--r--
2025-04-07 20:15
tracemalloc.cpython-311.pyc
28.4
KB
-rw-r--r--
2025-04-07 20:15
tty.cpython-311.pyc
1.98
KB
-rw-r--r--
2025-04-07 20:15
turtle.cpython-311.pyc
188.89
KB
-rw-r--r--
2025-04-07 20:15
types.cpython-311.pyc
14.47
KB
-rw-r--r--
2025-04-07 20:15
typing.cpython-311.pyc
154.24
KB
-rw-r--r--
2025-04-07 20:15
uu.cpython-311.pyc
8.15
KB
-rw-r--r--
2025-04-07 20:15
uuid.cpython-311.pyc
32.29
KB
-rw-r--r--
2025-04-07 20:15
warnings.cpython-311.pyc
24.45
KB
-rw-r--r--
2025-04-07 20:15
wave.cpython-311.pyc
31.58
KB
-rw-r--r--
2025-04-07 20:15
weakref.cpython-311.pyc
34.14
KB
-rw-r--r--
2025-04-07 20:15
webbrowser.cpython-311.pyc
31.98
KB
-rw-r--r--
2025-04-07 20:15
xdrlib.cpython-311.pyc
12.83
KB
-rw-r--r--
2025-04-07 20:15
zipapp.cpython-311.pyc
11.27
KB
-rw-r--r--
2025-04-07 20:15
zipfile.cpython-311.pyc
115.24
KB
-rw-r--r--
2025-04-07 20:15
zipimport.cpython-311.pyc
29.09
KB
-rw-r--r--
2025-04-07 20:15
Save
Rename
� *�Kg�Y � �X � d Z dZg d�Zd� Zd� Zd� Zd� Zd� Zd� Zd � Z d � Z d� Zd� Zd � Z d� Zddd�d�Zdd�Zdd�Z ddlT n# e$ r Y nw xY w ddlm Z n# e$ r Y nw xY w ddlm Z n# e$ r Y nw xY w ddlmZ n# e$ r Y nw xY wedk rddlZ e ej � � � � dS dS )a� Heap queue algorithm (a.k.a. priority queue). Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for all k, counting elements from 0. For the sake of comparison, non-existing elements are considered to be infinite. The interesting property of a heap is that a[0] is always its smallest element. Usage: heap = [] # creates an empty heap heappush(heap, item) # pushes a new item on the heap item = heappop(heap) # pops the smallest item from the heap item = heap[0] # smallest item on the heap without popping it heapify(x) # transforms list into a heap, in-place, in linear time item = heappushpop(heap, item) # pushes a new item and then returns # the smallest item; the heap size is unchanged item = heapreplace(heap, item) # pops and returns smallest item, and adds # new item; the heap size is unchanged Our API differs from textbook heap algorithms as follows: - We use 0-based indexing. This makes the relationship between the index for a node and the indexes for its children slightly less obvious, but is more suitable since Python uses 0-based indexing. - Our heappop() method returns the smallest item, not the largest. These two make it possible to view the heap as a regular Python list without surprises: heap[0] is the smallest item, and heap.sort() maintains the heap invariant! uo Heap queues [explanation by François Pinard] Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for all k, counting elements from 0. For the sake of comparison, non-existing elements are considered to be infinite. The interesting property of a heap is that a[0] is always its smallest element. The strange invariant above is meant to be an efficient memory representation for a tournament. The numbers below are `k', not a[k]: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 In the tree above, each cell `k' is topping `2*k+1' and `2*k+2'. In a usual binary tournament we see in sports, each cell is the winner over the two cells it tops, and we can trace the winner down the tree to see all opponents s/he had. However, in many computer applications of such tournaments, we do not need to trace the history of a winner. To be more memory efficient, when a winner is promoted, we try to replace it by something else at a lower level, and the rule becomes that a cell and the two cells it tops contain three different items, but the top cell "wins" over the two topped cells. If this heap invariant is protected at all time, index 0 is clearly the overall winner. The simplest algorithmic way to remove it and find the "next" winner is to move some loser (let's say cell 30 in the diagram above) into the 0 position, and then percolate this new 0 down the tree, exchanging values, until the invariant is re-established. This is clearly logarithmic on the total number of items in the tree. By iterating over all items, you get an O(n ln n) sort. A nice feature of this sort is that you can efficiently insert new items while the sort is going on, provided that the inserted items are not "better" than the last 0'th element you extracted. This is especially useful in simulation contexts, where the tree holds all incoming events, and the "win" condition means the smallest scheduled time. When an event schedule other events for execution, they are scheduled into the future, so they can easily go into the heap. So, a heap is a good structure for implementing schedulers (this is what I used for my MIDI sequencer :-). Various structures for implementing schedulers have been extensively studied, and heaps are good for this, as they are reasonably speedy, the speed is almost constant, and the worst case is not much different than the average case. However, there are other representations which are more efficient overall, yet the worst cases might be terrible. Heaps are also very useful in big disk sorts. You most probably all know that a big sort implies producing "runs" (which are pre-sorted sequences, which size is usually related to the amount of CPU memory), followed by a merging passes for these runs, which merging is often very cleverly organised[1]. It is very important that the initial sort produces the longest runs possible. Tournaments are a good way to that. If, using all the memory available to hold a tournament, you replace and percolate items that happen to fit the current run, you'll produce runs which are twice the size of the memory for random input, and much better for input fuzzily ordered. Moreover, if you output the 0'th item on disk and get an input which may not fit in the current tournament (because the value "wins" over the last output value), it cannot fit in the heap, so the size of the heap decreases. The freed memory could be cleverly reused immediately for progressively building a second heap, which grows at exactly the same rate the first heap is melting. When the first heap completely vanishes, you switch heaps and start a new run. Clever and quite effective! In a word, heaps are useful memory structures to know. I use them in a few applications, and I think it is good to keep a `heap' module around. :-) -------------------- [1] The disk balancing algorithms which are current, nowadays, are more annoying than clever, and this is a consequence of the seeking capabilities of the disks. On devices which cannot seek, like big tape drives, the story was quite different, and one had to be very clever to ensure (far in advance) that each tape movement will be the most effective possible (that is, will best participate at "progressing" the merge). Some tapes were even able to read backwards, and this was also used to avoid the rewinding time. Believe me, real good tape sorts were quite spectacular to watch! From all times, sorting has always been a Great Art! :-) )�heappush�heappop�heapify�heapreplace�merge�nlargest� nsmallest�heappushpopc �r � | � |� � t | dt | � � dz � � dS )z4Push item onto heap, maintaining the heap invariant.� � N)�append� _siftdown�len��heap�items �/usr/lib/python3.11/heapq.pyr r � s6 � ��K�K����� �d�A�s�4�y�y��{�#�#�#�#�#� c �p � | � � � }| r| d }|| d<