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.159
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 : StackedCacheMap.js
/* MIT License http://www.opensource.org/licenses/mit-license.php Author Tobias Koppers @sokra */ "use strict"; /** * The StackedCacheMap is a data structure designed as an alternative to a Map * in situations where you need to handle multiple item additions and * frequently access the largest map. * * It is particularly optimized for efficiently adding multiple items * at once, which can be achieved using the `addAll` method. * * It has a fallback Map that is used when the map to be added is mutable. * * Note: `delete` and `has` are not supported for performance reasons. * @example * ```js * const map = new StackedCacheMap(); * map.addAll(new Map([["a", 1], ["b", 2]]), true); * map.addAll(new Map([["c", 3], ["d", 4]]), true); * map.get("a"); // 1 * map.get("d"); // 4 * for (const [key, value] of map) { * console.log(key, value); * } * ``` * @template K * @template V */ class StackedCacheMap { constructor() { /** @type {Map<K, V>} */ this.map = new Map(); /** @type {ReadonlyMap<K, V>[]} */ this.stack = []; } /** * If `immutable` is true, the map can be referenced by the StackedCacheMap * and should not be changed afterwards. If the map is mutable, all items * are copied into a fallback Map. * @param {ReadonlyMap<K, V>} map map to add * @param {boolean=} immutable if 'map' is immutable and StackedCacheMap can keep referencing it */ addAll(map, immutable) { if (immutable) { this.stack.push(map); // largest map should go first for (let i = this.stack.length - 1; i > 0; i--) { const beforeLast = this.stack[i - 1]; if (beforeLast.size >= map.size) break; this.stack[i] = beforeLast; this.stack[i - 1] = map; } } else { for (const [key, value] of map) { this.map.set(key, value); } } } /** * @param {K} item the key of the element to add * @param {V} value the value of the element to add * @returns {void} */ set(item, value) { this.map.set(item, value); } /** * @param {K} item the item to delete * @returns {void} */ delete(item) { throw new Error("Items can't be deleted from a StackedCacheMap"); } /** * @param {K} item the item to test * @returns {boolean} true if the item exists in this set */ has(item) { throw new Error( "Checking StackedCacheMap.has before reading is inefficient, use StackedCacheMap.get and check for undefined" ); } /** * @param {K} item the key of the element to return * @returns {V | undefined} the value of the element */ get(item) { for (const map of this.stack) { const value = map.get(item); if (value !== undefined) return value; } return this.map.get(item); } clear() { this.stack.length = 0; this.map.clear(); } /** * @returns {number} size of the map */ get size() { let size = this.map.size; for (const map of this.stack) { size += map.size; } return size; } /** * @returns {Iterator<[K, V]>} iterator */ [Symbol.iterator]() { const iterators = this.stack.map(map => map[Symbol.iterator]()); let current = this.map[Symbol.iterator](); return { next() { let result = current.next(); while (result.done && iterators.length > 0) { current = /** @type {IterableIterator<[K, V]>} */ (iterators.pop()); result = current.next(); } return result; } }; } } module.exports = StackedCacheMap;
Close