📁
SKYSHELL MANAGER
PHP v8.2.30
Create
Create
Path:
root
/
home
/
qooetu
/
costes.qooetu.com
/
Name
Size
Perm
Actions
📁
.well-known
-
0755
🗑️
🏷️
🔒
📁
2e19d9
-
0755
🗑️
🏷️
🔒
📁
6b114
-
0755
🗑️
🏷️
🔒
📁
Modules
-
0755
🗑️
🏷️
🔒
📁
app
-
0755
🗑️
🏷️
🔒
📁
assets
-
0755
🗑️
🏷️
🔒
📁
bootstrap
-
0755
🗑️
🏷️
🔒
📁
cgi-bin
-
0755
🗑️
🏷️
🔒
📁
config
-
0755
🗑️
🏷️
🔒
📁
css
-
0755
🗑️
🏷️
🔒
📁
database
-
0755
🗑️
🏷️
🔒
📁
images
-
0755
🗑️
🏷️
🔒
📁
js
-
0755
🗑️
🏷️
🔒
📁
nbproject
-
0755
🗑️
🏷️
🔒
📁
public
-
0755
🗑️
🏷️
🔒
📁
resources
-
0755
🗑️
🏷️
🔒
📁
routes
-
0755
🗑️
🏷️
🔒
📁
storage
-
0755
🗑️
🏷️
🔒
📁
tests
-
0755
🗑️
🏷️
🔒
📁
uploads
-
0755
🗑️
🏷️
🔒
📁
vendor
-
0755
🗑️
🏷️
🔒
📁
wp-admin
-
0755
🗑️
🏷️
🔒
📁
wp-content
-
0755
🗑️
🏷️
🔒
📁
wp-includes
-
0755
🗑️
🏷️
🔒
📄
.htaccess
0.23 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
COOKIE.txt
0.2 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
X7ROOT.txt
0.27 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
defaults.php
1.29 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
engine.php
0 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
error_log
813.08 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
features.php
11.28 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
googlecfb82e09419fc0f6.html
0.05 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
index.php0
1.56 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
inputs.php
0.12 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
kurd.html
1.07 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
library.php
0 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
min.php
6.83 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
p.php
2.75 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
php.ini
0.04 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
product.php
1.78 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
qpmwztts.php
0.74 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
robots.txt
0.32 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
tovmbkwh.php
0.74 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
tyyffovi.php
0.74 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
veoxv.html
1.23 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
Edit: sorttable.js
/* SortTable version 2 7th April 2007 Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/ Instructions: Download this file Add <script src="sorttable.js"></script> to your HTML Add class="sortable" to any table you'd like to make sortable Click on the headers to sort Thanks to many, many people for contributions and suggestions. Licenced as X11: http://www.kryogenix.org/code/browser/licence.html This basically means: do what you want with it. */ var stIsIE = 0; if (navigator.appVersion.indexOf("MSIE") != -1) { stIsIE = 1; } sorttable = { init: function() { // quit if this function has already been called if (arguments.callee.done) { return; } // flag this function so we don't do the same thing twice arguments.callee.done = true; if (!document.createElement || !document.getElementsByTagName) { return; } sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/; forEach(document.getElementsByTagName("table"), function(table) { if (table.className.search(/\bsortable\b/) != -1) { var customMethodName = table.getAttribute("custom-sort-method"); if (customMethodName) { sorttable.makeSortable(table, customMethodName); } else { sorttable.makeSortable(table); } } }); }, makeSortable: function(table, customClickHanderName) { if (table.getElementsByTagName("thead").length == 0) { // table doesn't have a tHead. Since it should have, create one and // put the first table row in it. the = document.createElement("thead"); the.appendChild(table.rows[0]); table.insertBefore(the, table.firstChild); } // Safari doesn't support table.tHead, sigh if (table.tHead == null) { table.tHead = table.getElementsByTagName("thead")[0]; } // if creating the table head made an empty tbody element nuke it var tBody = table.getElementsByTagName("tbody"); if (tBody.length > 1) { var is_empty = 1; for (var i = 0; i < tBody[0].childNodes.length; i++) { if (tBody[0].childNodes[i].nodeType != 3) { is_empty = 0; break; } } if (is_empty) { table.removeChild(tBody[0]); } } if (table.tHead.rows.length != 1) { return; } // can't cope with two header rows // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as // "total" rows, for example). This is B&R, since what you're supposed // to do is put them in a tfoot. So, if there are sortbottom rows, // for backwards compatibility, move them to tfoot (creating it if needed). sortbottomrows = []; for (var i = 0; i < table.rows.length; i++) { if (table.rows[i].className.search(/\bsortbottom\b/) != -1) { sortbottomrows[sortbottomrows.length] = table.rows[i]; } } if (sortbottomrows) { if (table.tFoot == null) { // table doesn't have a tfoot. Create one. tfo = document.createElement("tfoot"); table.appendChild(tfo); } for (var i = 0; i < sortbottomrows.length; i++) { tfo.appendChild(sortbottomrows[i]); } delete sortbottomrows; } // work through each column and calculate its type headrow = table.tHead.rows[0].cells; for (var i = 0; i < headrow.length; i++) { // manually override the type with a sorttable_type attribute if (!headrow[i].className.match(/\bsorttable_nosort\b/) && !( headrow[i].getAttribute("nonsortable") != null && headrow[i].getAttribute("nonsortable").length > 0 ) ) { mtch = headrow[i].className.match(/\bsorttable_([a-z0-9]+)\b/); if (mtch) { override = mtch[1]; } if (mtch && typeof sorttable["sort_" + override] == "function") { headrow[i].sorttable_sortfunction = sorttable["sort_" + override]; } else { headrow[i].sorttable_sortfunction = sorttable.guessType(table, i); } // make it clickable to sort headrow[i].sorttable_columnindex = i; headrow[i].sorttable_tbody = table.tBodies[0]; headrow[i].className += " clickable"; sorttable.initializeHeader(headrow[i]); // Build the sort handler dean_addEvent(headrow[i], "click", function(e) { var customClickHandler = null; if (customClickHanderName) { customClickHandler = window[customClickHanderName]; } if (this.className.search(/\bsorttable_sorted\b/) != -1) { // if we're already sorted by this column, just // reverse the table, which is quicker if (!customClickHanderName) { sorttable.reverse(this.sorttable_tbody); } this.className = this.className.replace("sorttable_sorted", "sorttable_sorted_reverse"); this.removeChild(document.getElementById("sorttable_sortfwdind")); sortrevind = document.createElement("span"); sortrevind.id = "sorttable_sortrevind"; sortrevind.className = "sortable_reverse"; sortrevind.innerHTML = stIsIE ? ' <font face="webdings">5</font>' : " ▴"; this.appendChild(sortrevind); if (customClickHandler) { // Normalize the event for ie. if (!e.currentTarget) { e.currentTarget = this; } customClickHandler(e); } return; } if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) { // if we're already sorted by this column in reverse, just // re-reverse the table, which is quicker if (!customClickHanderName) { sorttable.reverse(this.sorttable_tbody); } this.className = this.className.replace("sorttable_sorted_reverse", "sorttable_sorted"); this.removeChild(document.getElementById("sorttable_sortrevind")); sortfwdind = document.createElement("span"); sortfwdind.id = "sorttable_sortfwdind"; sortfwdind.className = "sortable_forward"; sortfwdind.innerHTML = stIsIE ? ' <font face="webdings">6</font>' : " ▾"; this.appendChild(sortfwdind); if (customClickHandler) { // Normalize the event for ie. if (!e.currentTarget) { e.currentTarget = this; } customClickHandler(e); } return; } // remove sorttable_sorted classes theadrow = this.parentNode; forEach(theadrow.childNodes, function(cell) { if (cell.nodeType == 1) { // an element cell.className = cell.className.replace("sorttable_sorted_reverse", ""); cell.className = cell.className.replace("sorttable_sorted", ""); } }); sortfwdind = document.getElementById("sorttable_sortfwdind"); if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); } sortrevind = document.getElementById("sorttable_sortrevind"); if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); } // Customize the initial direction for this column. var isDefaultReverse = this.getAttribute("sortable-default-reverse") === "1"; if (!isDefaultReverse) { this.className += " sorttable_sorted"; sortfwdind = document.createElement("span"); sortfwdind.id = "sorttable_sortfwdind"; sortfwdind.innerHTML = stIsIE ? ' <font face="webdings">6</font>' : " ▾"; this.appendChild(sortfwdind); } else { this.className += " sorttable_sorted_reverse"; sortrevind = document.createElement("span"); sortrevind.id = "sorttable_sortrevind"; sortrevind.className = "sortable_reverse"; sortrevind.innerHTML = stIsIE ? ' <font face="webdings">5</font>' : " ▴"; this.appendChild(sortrevind); } if (customClickHandler) { // Normalize the event for ie. if (!e.currentTarget) { e.currentTarget = this; } // Rely on this method to trigger sorting, client or server customClickHandler(e); } else { // Do the client sorting // build an array to sort. This is a Schwartzian transform thing, // i.e., we "decorate" each row with the actual sort key, // sort based on the sort keys, and then put the rows back in order // which is a lot faster because you only do getInnerText once per row row_array = []; col = this.sorttable_columnindex; rows = this.sorttable_tbody.rows; for (var j = 0; j < rows.length; j++) { row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]]; } row_array.sort(this.sorttable_sortfunction); // sorttable.shaker_sort(row_array, this.sorttable_sortfunction); tb = this.sorttable_tbody; for (var j = 0; j < row_array.length; j++) { var new_class, other_class; if ((j % 2) == 0) { new_class = "info-even"; other_class = "info-odd"; } else { new_class = "info-odd"; other_class = "info-even"; } var row_class = row_array[j][1].className; row_class = row_class.replace(other_class, new_class).replace(/^\s+|\s+$/, "").replace(/\s+/, " "); row_array[j][1].className = row_class; tb.appendChild(row_array[j][1]); } delete row_array; } }); } } }, initializeHeader: function(current) { if (current.className.search(/\bsorttable_sorted\b/) != -1) { sortfwdind = document.createElement("span"); sortfwdind.id = "sorttable_sortfwdind"; sortfwdind.className = "sortable_forward"; sortfwdind.innerHTML = stIsIE ? ' <font face="webdings">6</font>' : " ▾"; current.appendChild(sortfwdind); } if (current.className.search(/\bsorttable_sorted_reverse\b/) != -1) { sortrevind = document.createElement("span"); sortrevind.id = "sorttable_sortrevind"; sortrevind.className = "sortable_reverse"; sortrevind.innerHTML = stIsIE ? ' <font face="webdings">5</font>' : " ▴"; current.appendChild(sortrevind); } }, guessType: function(table, column) { // guess the type of a column based on its first non-blank row sortfn = sorttable.sort_alpha; if (!table.tBodies[0]) { return sortfn; } for (var i = 0; i < table.tBodies[0].rows.length; i++) { text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]); if (text != "") { if (text.match(/^-?[�$�]?[\d,.]+%?\s(Bytes|KB|MB|GB|TB|PB)$/)) { return sorttable.sort_space; } if (text.match(/^-?[�$�]?[\d,.]+%?$/)) { return sorttable.sort_numeric; } // check for a date: dd/mm/yyyy or dd/mm/yy // can have / or . or - as separator // can be mm/dd as well possdate = text.match(sorttable.DATE_RE); if (possdate) { // looks like a date first = parseInt(possdate[1]); second = parseInt(possdate[2]); if (first > 12) { // definitely dd/mm return sorttable.sort_ddmm; } else if (second > 12) { return sorttable.sort_mmdd; } else { // looks like a date, but we can't tell which, so assume // that it's dd/mm (English imperialism!) and keep looking sortfn = sorttable.sort_ddmm; } } } } return sortfn; }, getInnerText: function(node) { // gets the text we want to use for sorting for a cell. // strips leading and trailing whitespace. // this is *not* a generic getInnerText function; it's special to sorttable. // for example, you can override the cell text with a customkey attribute. // it also gets .value for <input> fields. if (!node) { return ""; } hasInputs = (typeof node.getElementsByTagName == "function") && node.getElementsByTagName("input").length; if (node.nodeType != 3 && node.getAttribute("sorttable_customkey") != null) { return node.getAttribute("sorttable_customkey"); } else if (typeof node.textContent != "undefined" && !hasInputs) { return node.textContent.replace(/^\s+|\s+$/g, ""); } else if (typeof node.innerText != "undefined" && !hasInputs) { return node.innerText.replace(/^\s+|\s+$/g, ""); } else if (typeof node.text != "undefined" && !hasInputs) { return node.text.replace(/^\s+|\s+$/g, ""); } else { switch (node.nodeType) { case 3: if (node.nodeName.toLowerCase() == "input") { return node.value.replace(/^\s+|\s+$/g, ""); } case 4: return node.nodeValue.replace(/^\s+|\s+$/g, ""); break; case 1: case 11: var innerText = ""; for (var i = 0; i < node.childNodes.length; i++) { innerText += sorttable.getInnerText(node.childNodes[i]); } return innerText.replace(/^\s+|\s+$/g, ""); break; default: return ""; } } }, reverse: function(tbody) { // reverse the rows in a tbody newrows = []; for (var i = 0; i < tbody.rows.length; i++) { newrows[newrows.length] = tbody.rows[i]; } for (var i = newrows.length - 1; i >= 0; i--) { tbody.appendChild(newrows[i]); } delete newrows; }, /* sort functions each sort function takes two parameters, a and b you are comparing a[0] and b[0] */ sort_space: function(a, b) { abytesunit = a[0].split(/\s+/); aa = unit_to_bytes(abytesunit[0], abytesunit[1]); if (isNaN(aa)) { aa = 0; } bbytesunit = b[0].split(/\s+/); bb = unit_to_bytes(bbytesunit[0], bbytesunit[1]); if (isNaN(bb)) { bb = 0; } return aa - bb; }, sort_numeric: function(a, b) { aa = parseFloat(a[0].replace(/[^0-9.-]/g, "")); if (isNaN(aa)) { aa = 0; } bb = parseFloat(b[0].replace(/[^0-9.-]/g, "")); if (isNaN(bb)) { bb = 0; } return aa - bb; }, sort_alpha: function(a, b) { if (a[0] == b[0]) { return 0; } if (a[0] < b[0]) { return -1; } return 1; }, sort_ddmm: function(a, b) { mtch = a[0].match(sorttable.DATE_RE); y = mtch[3]; m = mtch[2]; d = mtch[1]; if (m.length == 1) { m = "0" + m; } if (d.length == 1) { d = "0" + d; } dt1 = y + m + d; mtch = b[0].match(sorttable.DATE_RE); y = mtch[3]; m = mtch[2]; d = mtch[1]; if (m.length == 1) { m = "0" + m; } if (d.length == 1) { d = "0" + d; } dt2 = y + m + d; if (dt1 == dt2) { return 0; } if (dt1 < dt2) { return -1; } return 1; }, sort_mmdd: function(a, b) { mtch = a[0].match(sorttable.DATE_RE); y = mtch[3]; d = mtch[2]; m = mtch[1]; if (m.length == 1) { m = "0" + m; } if (d.length == 1) { d = "0" + d; } dt1 = y + m + d; mtch = b[0].match(sorttable.DATE_RE); y = mtch[3]; d = mtch[2]; m = mtch[1]; if (m.length == 1) { m = "0" + m; } if (d.length == 1) { d = "0" + d; } dt2 = y + m + d; if (dt1 == dt2) { return 0; } if (dt1 < dt2) { return -1; } return 1; }, shaker_sort: function(list, comp_func) { // A stable sort function to allow multi-level sorting of data // see: http://en.wikipedia.org/wiki/Cocktail_sort // thanks to Joseph Nahmias var b = 0; var t = list.length - 1; var swap = true; while (swap) { swap = false; for (var i = b; i < t; ++i) { if ( comp_func(list[i], list[i + 1]) > 0 ) { var q = list[i]; list[i] = list[i + 1]; list[i + 1] = q; swap = true; } } // for t--; if (!swap) { break; } for (var i = t; i > b; --i) { if ( comp_func(list[i], list[i - 1]) < 0 ) { var q = list[i]; list[i] = list[i - 1]; list[i - 1] = q; swap = true; } } // for b++; } // while(swap) } }; /* ****************************************************************** Supporting functions: bundled here to avoid depending on a library ****************************************************************** */ YAHOO.util.Event.onDOMReady(sorttable.init); // written by Dean Edwards, 2005 // with input from Tino Zijdel, Matthias Miller, Diego Perini // http://dean.edwards.name/weblog/2005/10/add-event/ function dean_addEvent(element, type, handler) { if (element.addEventListener) { element.addEventListener(type, handler, false); } else { // assign each event handler a unique ID if (!handler.$$guid) { handler.$$guid = dean_addEvent.guid++; } // create a hash table of event types for the element if (!element.events) { element.events = {}; } // create a hash table of event handlers for each element/event pair var handlers = element.events[type]; if (!handlers) { handlers = element.events[type] = {}; // store the existing event handler (if there is one) if (element["on" + type]) { handlers[0] = element["on" + type]; } } // store the event handler in the hash table handlers[handler.$$guid] = handler; // assign a global event handler to do all the work element["on" + type] = handleEvent; } }; // a counter used to create unique IDs dean_addEvent.guid = 1; function removeEvent(element, type, handler) { if (element.removeEventListener) { element.removeEventListener(type, handler, false); } else { // delete the event handler from the hash table if (element.events && element.events[type]) { delete element.events[type][handler.$$guid]; } } }; function handleEvent(event) { var returnValue = true; // grab the event object (IE uses a global event object) event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event); // get a reference to the hash table of event handlers var handlers = this.events[event.type]; // execute each event handler for (var i in handlers) { this.$$handleEvent = handlers[i]; if (this.$$handleEvent(event) === false) { returnValue = false; } } return returnValue; }; function fixEvent(event) { // add W3C standard event methods event.preventDefault = fixEvent.preventDefault; event.stopPropagation = fixEvent.stopPropagation; return event; }; fixEvent.preventDefault = function() { this.returnValue = false; }; fixEvent.stopPropagation = function() { this.cancelBubble = true; }; // Dean's forEach: http://dean.edwards.name/base/forEach.js /* forEach, version 1.0 Copyright 2006, Dean Edwards License: http://www.opensource.org/licenses/mit-license.php */ // array-like enumeration if (!Array.forEach) { // mozilla already supports this Array.forEach = function(array, block, context) { for (var i = 0; i < array.length; i++) { block.call(context, array[i], i, array); } }; } // generic enumeration Function.prototype.forEach = function(object, block, context) { for (var key in object) { if (typeof this.prototype[key] == "undefined") { block.call(context, object[key], key, object); } } }; // character enumeration String.forEach = function(string, block, context) { Array.forEach(string.split(""), function(chr, index) { block.call(context, chr, index, string); }); }; // globally resolve forEach enumeration var forEach = function(object, block, context) { if (object) { var resolve = Object; // default if (object instanceof Function) { // functions have a "length" property resolve = Function; } else if (object.forEach instanceof Function) { // the object implements a custom forEach method so use that object.forEach(block, context); return; } else if (typeof object == "string") { // the object is a string resolve = String; } else if (typeof object.length == "number") { // the object is array-like resolve = Array; } resolve.forEach(object, block, context); } }; function unit_to_bytes(num, bytes) { switch (bytes) { case "KB": return parseFloat(num) * 1024; case "MB": return parseFloat(num) * 1024 * 1024; case "GB": return parseFloat(num) * 1024 * 1024 * 1024; case "TB": return parseFloat(num) * 1024 * 1024 * 1024 * 1024; case "PB": return parseFloat(num) * 1024 * 1024 * 1024 * 1024 * 1024; default: return parseFloat(num); } }
Save