Linux ubuntu22 5.15.0-133-generic #144-Ubuntu SMP Fri Feb 7 20:47:38 UTC 2025 x86_64
nginx/1.18.0
: 128.199.27.159 | : 216.73.216.1
Cant Read [ /etc/named.conf ]
8.1.31
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
/
var /
www /
html /
amatya /
node_modules /
async /
[ HOME SHELL ]
Name
Size
Permission
Action
dist
[ DIR ]
drwxr-xr-x
internal
[ DIR ]
drwxr-xr-x
CHANGELOG.md
28.53
KB
-rw-r--r--
LICENSE
1.04
KB
-rw-r--r--
README.md
2.48
KB
-rw-r--r--
all.js
1.64
KB
-rw-r--r--
allLimit.js
1.51
KB
-rw-r--r--
allSeries.js
1.25
KB
-rw-r--r--
any.js
1.72
KB
-rw-r--r--
anyLimit.js
1.55
KB
-rw-r--r--
anySeries.js
1.28
KB
-rw-r--r--
apply.js
1.8
KB
-rw-r--r--
applyEach.js
1.74
KB
-rw-r--r--
applyEachSeries.js
1.25
KB
-rw-r--r--
asyncify.js
3.42
KB
-rw-r--r--
auto.js
9.61
KB
-rw-r--r--
autoInject.js
6.33
KB
-rw-r--r--
bower.json
245
B
-rw-r--r--
cargo.js
4.54
KB
-rw-r--r--
compose.js
1.52
KB
-rw-r--r--
concat.js
1.55
KB
-rw-r--r--
concatLimit.js
2.11
KB
-rw-r--r--
concatSeries.js
1.24
KB
-rw-r--r--
constant.js
1.72
KB
-rw-r--r--
detect.js
2.16
KB
-rw-r--r--
detectLimit.js
1.72
KB
-rw-r--r--
detectSeries.js
1.32
KB
-rw-r--r--
dir.js
1.26
KB
-rw-r--r--
doDuring.js
2.13
KB
-rw-r--r--
doUntil.js
1.34
KB
-rw-r--r--
doWhilst.js
2.02
KB
-rw-r--r--
during.js
2.15
KB
-rw-r--r--
each.js
2.77
KB
-rw-r--r--
eachLimit.js
1.53
KB
-rw-r--r--
eachOf.js
3.29
KB
-rw-r--r--
eachOfLimit.js
1.38
KB
-rw-r--r--
eachOfSeries.js
1.11
KB
-rw-r--r--
eachSeries.js
1.18
KB
-rw-r--r--
ensureAsync.js
2.46
KB
-rw-r--r--
every.js
1.64
KB
-rw-r--r--
everyLimit.js
1.51
KB
-rw-r--r--
everySeries.js
1.25
KB
-rw-r--r--
filter.js
1.49
KB
-rw-r--r--
filterLimit.js
1.31
KB
-rw-r--r--
filterSeries.js
1.21
KB
-rw-r--r--
find.js
2.16
KB
-rw-r--r--
findLimit.js
1.72
KB
-rw-r--r--
findSeries.js
1.32
KB
-rw-r--r--
foldl.js
2.61
KB
-rw-r--r--
foldr.js
1.5
KB
-rw-r--r--
forEach.js
2.77
KB
-rw-r--r--
forEachLimit.js
1.53
KB
-rw-r--r--
forEachOf.js
3.29
KB
-rw-r--r--
forEachOfLimit.js
1.38
KB
-rw-r--r--
forEachOfSeries.js
1.11
KB
-rw-r--r--
forEachSeries.js
1.18
KB
-rw-r--r--
forever.js
1.9
KB
-rw-r--r--
groupBy.js
2.08
KB
-rw-r--r--
groupByLimit.js
2.32
KB
-rw-r--r--
groupBySeries.js
1.32
KB
-rw-r--r--
index.js
19.05
KB
-rw-r--r--
inject.js
2.61
KB
-rw-r--r--
log.js
1.17
KB
-rw-r--r--
map.js
2.03
KB
-rw-r--r--
mapLimit.js
1.28
KB
-rw-r--r--
mapSeries.js
1.18
KB
-rw-r--r--
mapValues.js
2.19
KB
-rw-r--r--
mapValuesLimit.js
1.99
KB
-rw-r--r--
mapValuesSeries.js
1.3
KB
-rw-r--r--
memoize.js
3.16
KB
-rw-r--r--
nextTick.js
1.41
KB
-rw-r--r--
package.json
2.56
KB
-rw-r--r--
parallel.js
3.03
KB
-rw-r--r--
parallelLimit.js
1.39
KB
-rw-r--r--
priorityQueue.js
3.03
KB
-rw-r--r--
queue.js
5.72
KB
-rw-r--r--
race.js
2.11
KB
-rw-r--r--
reduce.js
2.61
KB
-rw-r--r--
reduceRight.js
1.5
KB
-rw-r--r--
reflect.js
2.32
KB
-rw-r--r--
reflectAll.js
2.73
KB
-rw-r--r--
reject.js
1.41
KB
-rw-r--r--
rejectLimit.js
1.24
KB
-rw-r--r--
rejectSeries.js
1.13
KB
-rw-r--r--
retry.js
5.31
KB
-rw-r--r--
retryable.js
1.98
KB
-rw-r--r--
select.js
1.49
KB
-rw-r--r--
selectLimit.js
1.31
KB
-rw-r--r--
selectSeries.js
1.21
KB
-rw-r--r--
seq.js
2.92
KB
-rw-r--r--
series.js
2.87
KB
-rw-r--r--
setImmediate.js
1.36
KB
-rw-r--r--
some.js
1.72
KB
-rw-r--r--
someLimit.js
1.55
KB
-rw-r--r--
someSeries.js
1.28
KB
-rw-r--r--
sortBy.js
2.76
KB
-rw-r--r--
timeout.js
2.71
KB
-rw-r--r--
times.js
1.42
KB
-rw-r--r--
timesLimit.js
1.36
KB
-rw-r--r--
timesSeries.js
1021
B
-rw-r--r--
transform.js
2.65
KB
-rw-r--r--
tryEach.js
2.5
KB
-rw-r--r--
unmemoize.js
681
B
-rw-r--r--
until.js
1.41
KB
-rw-r--r--
waterfall.js
3.26
KB
-rw-r--r--
whilst.js
2.14
KB
-rw-r--r--
wrapSync.js
3.42
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : auto.js
'use strict'; Object.defineProperty(exports, "__esModule", { value: true }); exports.default = function (tasks, concurrency, callback) { if (typeof concurrency === 'function') { // concurrency is optional, shift the args. callback = concurrency; concurrency = null; } callback = (0, _once2.default)(callback || _noop2.default); var keys = (0, _keys2.default)(tasks); var numTasks = keys.length; if (!numTasks) { return callback(null); } if (!concurrency) { concurrency = numTasks; } var results = {}; var runningTasks = 0; var hasError = false; var listeners = Object.create(null); var readyTasks = []; // for cycle detection: var readyToCheck = []; // tasks that have been identified as reachable // without the possibility of returning to an ancestor task var uncheckedDependencies = {}; (0, _baseForOwn2.default)(tasks, function (task, key) { if (!(0, _isArray2.default)(task)) { // no dependencies enqueueTask(key, [task]); readyToCheck.push(key); return; } var dependencies = task.slice(0, task.length - 1); var remainingDependencies = dependencies.length; if (remainingDependencies === 0) { enqueueTask(key, task); readyToCheck.push(key); return; } uncheckedDependencies[key] = remainingDependencies; (0, _arrayEach2.default)(dependencies, function (dependencyName) { if (!tasks[dependencyName]) { throw new Error('async.auto task `' + key + '` has a non-existent dependency `' + dependencyName + '` in ' + dependencies.join(', ')); } addListener(dependencyName, function () { remainingDependencies--; if (remainingDependencies === 0) { enqueueTask(key, task); } }); }); }); checkForDeadlocks(); processQueue(); function enqueueTask(key, task) { readyTasks.push(function () { runTask(key, task); }); } function processQueue() { if (readyTasks.length === 0 && runningTasks === 0) { return callback(null, results); } while (readyTasks.length && runningTasks < concurrency) { var run = readyTasks.shift(); run(); } } function addListener(taskName, fn) { var taskListeners = listeners[taskName]; if (!taskListeners) { taskListeners = listeners[taskName] = []; } taskListeners.push(fn); } function taskComplete(taskName) { var taskListeners = listeners[taskName] || []; (0, _arrayEach2.default)(taskListeners, function (fn) { fn(); }); processQueue(); } function runTask(key, task) { if (hasError) return; var taskCallback = (0, _onlyOnce2.default)(function (err, result) { runningTasks--; if (arguments.length > 2) { result = (0, _slice2.default)(arguments, 1); } if (err) { var safeResults = {}; (0, _baseForOwn2.default)(results, function (val, rkey) { safeResults[rkey] = val; }); safeResults[key] = result; hasError = true; listeners = Object.create(null); callback(err, safeResults); } else { results[key] = result; taskComplete(key); } }); runningTasks++; var taskFn = (0, _wrapAsync2.default)(task[task.length - 1]); if (task.length > 1) { taskFn(results, taskCallback); } else { taskFn(taskCallback); } } function checkForDeadlocks() { // Kahn's algorithm // https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm // http://connalle.blogspot.com/2013/10/topological-sortingkahn-algorithm.html var currentTask; var counter = 0; while (readyToCheck.length) { currentTask = readyToCheck.pop(); counter++; (0, _arrayEach2.default)(getDependents(currentTask), function (dependent) { if (--uncheckedDependencies[dependent] === 0) { readyToCheck.push(dependent); } }); } if (counter !== numTasks) { throw new Error('async.auto cannot execute tasks due to a recursive dependency'); } } function getDependents(taskName) { var result = []; (0, _baseForOwn2.default)(tasks, function (task, key) { if ((0, _isArray2.default)(task) && (0, _baseIndexOf2.default)(task, taskName, 0) >= 0) { result.push(key); } }); return result; } }; var _arrayEach = require('lodash/_arrayEach'); var _arrayEach2 = _interopRequireDefault(_arrayEach); var _baseForOwn = require('lodash/_baseForOwn'); var _baseForOwn2 = _interopRequireDefault(_baseForOwn); var _baseIndexOf = require('lodash/_baseIndexOf'); var _baseIndexOf2 = _interopRequireDefault(_baseIndexOf); var _isArray = require('lodash/isArray'); var _isArray2 = _interopRequireDefault(_isArray); var _keys = require('lodash/keys'); var _keys2 = _interopRequireDefault(_keys); var _noop = require('lodash/noop'); var _noop2 = _interopRequireDefault(_noop); var _slice = require('./internal/slice'); var _slice2 = _interopRequireDefault(_slice); var _once = require('./internal/once'); var _once2 = _interopRequireDefault(_once); var _onlyOnce = require('./internal/onlyOnce'); var _onlyOnce2 = _interopRequireDefault(_onlyOnce); var _wrapAsync = require('./internal/wrapAsync'); var _wrapAsync2 = _interopRequireDefault(_wrapAsync); function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; } module.exports = exports['default']; /** * Determines the best order for running the {@link AsyncFunction}s in `tasks`, based on * their requirements. Each function can optionally depend on other functions * being completed first, and each function is run as soon as its requirements * are satisfied. * * If any of the {@link AsyncFunction}s pass an error to their callback, the `auto` sequence * will stop. Further tasks will not execute (so any other functions depending * on it will not run), and the main `callback` is immediately called with the * error. * * {@link AsyncFunction}s also receive an object containing the results of functions which * have completed so far as the first argument, if they have dependencies. If a * task function has no dependencies, it will only be passed a callback. * * @name auto * @static * @memberOf module:ControlFlow * @method * @category Control Flow * @param {Object} tasks - An object. Each of its properties is either a * function or an array of requirements, with the {@link AsyncFunction} itself the last item * in the array. The object's key of a property serves as the name of the task * defined by that property, i.e. can be used when specifying requirements for * other tasks. The function receives one or two arguments: * * a `results` object, containing the results of the previously executed * functions, only passed if the task has any dependencies, * * a `callback(err, result)` function, which must be called when finished, * passing an `error` (which can be `null`) and the result of the function's * execution. * @param {number} [concurrency=Infinity] - An optional `integer` for * determining the maximum number of tasks that can be run in parallel. By * default, as many as possible. * @param {Function} [callback] - An optional callback which is called when all * the tasks have been completed. It receives the `err` argument if any `tasks` * pass an error to their callback. Results are always returned; however, if an * error occurs, no further `tasks` will be performed, and the results object * will only contain partial results. Invoked with (err, results). * @returns undefined * @example * * async.auto({ * // this function will just be passed a callback * readData: async.apply(fs.readFile, 'data.txt', 'utf-8'), * showData: ['readData', function(results, cb) { * // results.readData is the file's contents * // ... * }] * }, callback); * * async.auto({ * get_data: function(callback) { * console.log('in get_data'); * // async code to get some data * callback(null, 'data', 'converted to array'); * }, * make_folder: function(callback) { * console.log('in make_folder'); * // async code to create a directory to store a file in * // this is run at the same time as getting the data * callback(null, 'folder'); * }, * write_file: ['get_data', 'make_folder', function(results, callback) { * console.log('in write_file', JSON.stringify(results)); * // once there is some data and the directory exists, * // write the data to a file in the directory * callback(null, 'filename'); * }], * email_link: ['write_file', function(results, callback) { * console.log('in email_link', JSON.stringify(results)); * // once the file is written let's email a link to it... * // results.write_file contains the filename returned by write_file. * callback(null, {'file':results.write_file, 'email':'user@example.com'}); * }] * }, function(err, results) { * console.log('err = ', err); * console.log('results = ', results); * }); */
Close