Linux localhost 5.4.0-198-generic #218-Ubuntu SMP Fri Sep 27 20:18:53 UTC 2024 x86_64
Apache/2.4.41 (Ubuntu)
: 23.92.16.63 | : 172.70.114.232
Cant Read [ /etc/named.conf ]
8.1.5
www-data
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
lib /
node_modules /
npm /
node_modules /
abbrev /
lib /
[ HOME SHELL ]
Name
Size
Permission
Action
index.js
1.28
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : index.js
module.exports = abbrev function abbrev (...args) { let list = args.length === 1 || Array.isArray(args[0]) ? args[0] : args for (let i = 0, l = list.length; i < l; i++) { list[i] = typeof list[i] === 'string' ? list[i] : String(list[i]) } // sort them lexicographically, so that they're next to their nearest kin list = list.sort(lexSort) // walk through each, seeing how much it has in common with the next and previous const abbrevs = {} let prev = '' for (let ii = 0, ll = list.length; ii < ll; ii++) { const current = list[ii] const next = list[ii + 1] || '' let nextMatches = true let prevMatches = true if (current === next) { continue } let j = 0 const cl = current.length for (; j < cl; j++) { const curChar = current.charAt(j) nextMatches = nextMatches && curChar === next.charAt(j) prevMatches = prevMatches && curChar === prev.charAt(j) if (!nextMatches && !prevMatches) { j++ break } } prev = current if (j === cl) { abbrevs[current] = current continue } for (let a = current.slice(0, j); j <= cl; j++) { abbrevs[a] = current a += current.charAt(j) } } return abbrevs } function lexSort (a, b) { return a === b ? 0 : a > b ? 1 : -1 }
Close