/
var
/
www
/
flurhymez
/
node_modules
/
webpack
/
lib
/
util
/
/var/www/flurhymez/node_modules/webpack/lib/util
mkdir
upload
Name
Size
Mode
Actions
hash/
-
0755
rm
ArrayHelpers.js
280
0644
edit
dl
rm
ArrayQueue.js
2198
0644
edit
dl
rm
AsyncQueue.js
9631
0644
edit
dl
rm
binarySearchBounds.js
1907
0644
edit
dl
rm
cleverMerge.js
16534
0644
edit
dl
rm
comparators.js
12446
0644
edit
dl
rm
compileBooleanMatcher.js
5822
0644
edit
dl
rm
create-schema-validation.js
477
0644
edit
dl
rm
createHash.js
4819
0644
edit
dl
rm
deprecation.js
6454
0644
edit
dl
rm
deterministicGrouping.js
13764
0644
edit
dl
rm
extractUrlAndGlobal.js
416
0644
edit
dl
rm
findGraphRoots.js
6111
0644
edit
dl
rm
fs.js
10776
0644
edit
dl
rm
Hash.js
925
0644
edit
dl
rm
identifier.js
10335
0644
edit
dl
rm
internalSerializables.js
9973
0644
edit
dl
rm
IterableHelpers.js
962
0644
edit
dl
rm
LazyBucketSortedSet.js
5732
0644
edit
dl
rm
LazySet.js
4569
0644
edit
dl
rm
makeSerializable.js
640
0644
edit
dl
rm
MapHelpers.js
472
0644
edit
dl
rm
memoize.js
604
0644
edit
dl
rm
numberHash.js
1060
0644
edit
dl
rm
objectToMap.js
346
0644
edit
dl
rm
ParallelismFactorCalculator.js
1528
0644
edit
dl
rm
processAsyncTree.js
1483
0644
edit
dl
rm
propertyAccess.js
1190
0644
edit
dl
rm
Queue.js
1048
0644
edit
dl
rm
registerExternalSerializer.js
7913
0644
edit
dl
rm
runtime.js
14605
0644
edit
dl
rm
Semaphore.js
1008
0644
edit
dl
rm
semver.js
15546
0644
edit
dl
rm
serialization.js
4018
0644
edit
dl
rm
SetHelpers.js
2316
0644
edit
dl
rm
smartGrouping.js
5271
0644
edit
dl
rm
SortableSet.js
3635
0644
edit
dl
rm
source.js
1759
0644
edit
dl
rm
StackedCacheMap.js
2284
0644
edit
dl
rm
StackedMap.js
3453
0644
edit
dl
rm
StringXor.js
1120
0644
edit
dl
rm
TupleQueue.js
1317
0644
edit
dl
rm
TupleSet.js
2909
0644
edit
dl
rm
URLAbsoluteSpecifier.js
2553
0644
edit
dl
rm
WeakTupleMap.js
3443
0644
edit
dl
rm
Edit:
/var/www/flurhymez/node_modules/webpack/lib/util/StackedCacheMap.js
(2284B)
/* MIT License http://www.opensource.org/licenses/mit-license.php Author Tobias Koppers @sokra */ "use strict"; /** * @template K * @template V */ class StackedCacheMap { constructor() { /** @type {Map<K, V>} */ this.map = new Map(); /** @type {ReadonlyMap<K, V>[]} */ this.stack = []; } /** * @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} 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(); } get size() { let size = this.map.size; for (const map of this.stack) { size += map.size; } return size; } [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 = iterators.pop(); result = current.next(); } return result; } }; } } module.exports = StackedCacheMap;
Save
cmd:
run