Linux websever 5.15.0-153-generic #163-Ubuntu SMP Thu Aug 7 16:37:18 UTC 2025 x86_64
Apache/2.4.52 (Ubuntu)
: 192.168.3.70 | : 192.168.1.99
Cant Read [ /etc/named.conf ]
8.1.2-1ubuntu2.23
urlab
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 /
share /
nodejs /
npm /
node_modules /
treeverse /
lib /
[ HOME SHELL ]
Name
Size
Permission
Action
breadth.js
1.68
KB
-rw-r--r--
depth-descent.js
1.7
KB
-rw-r--r--
depth.js
2.04
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : depth.js
// Perform a depth-first walk of a tree. // // `visit(node)` is called when the node is first encountered. // `leave(node, children)` is called when all of the node's children // have been left or (in the case of cyclic graphs) visited. // // Only one of visit or leave is required. (Technically both are optional, // but if you don't provide at least one, the tree is just walked without // doing anything, which is a bit pointless.) If visit is provided, and // leave is not, then this is a root->leaf traversal. If leave is provided, // and visit is not, then it's leaf->root. Both can be provided for a // map-reduce operation. // // If either visit or leave return a Promise for any node, then the // walk returns a Promise. const depthDescent = require('./depth-descent.js') const depth = ({ visit, leave, filter = () => true, seen = new Map(), getChildren, tree, }) => { if (!leave) return depthDescent({ visit, filter, getChildren, tree }) if (seen.has(tree)) return seen.get(tree) seen.set(tree, null) const visitNode = () => { const res = visit ? visit(tree) : tree if (isPromise(res)) { const fullResult = res.then(res => { seen.set(tree, res) return kidNodes() }) seen.set(tree, fullResult) return fullResult } else { seen.set(tree, res) return kidNodes() } } const kidNodes = () => { const kids = getChildren(tree, seen.get(tree)) return isPromise(kids) ? kids.then(processKids) : processKids(kids) } const processKids = kidNodes => { const kids = (kidNodes || []).filter(filter).map(kid => depth({visit, leave, filter, seen, getChildren, tree: kid})) return kids.some(isPromise) ? Promise.all(kids).then(leaveNode) : leaveNode(kids) } const leaveNode = kids => { const res = leave(seen.get(tree), kids) seen.set(tree, res) // if it's a promise at this point, the caller deals with it return res } return visitNode() } const isPromise = p => p && typeof p.then === 'function' module.exports = depth
Close