Gecko [ unitednationsplay.com ]

Name	Size	Permission	Date
hash	[ DIR ]	drwxrwxr-x	2022-08-30 11:49
ArrayHelpers.js	1.45 KB	-rw-rw-r--	2022-08-30 11:49
ArrayQueue.js	2.15 KB	-rw-rw-r--	2022-08-30 11:49
AsyncQueue.js	9.41 KB	-rw-rw-r--	2022-08-30 11:49
Hash.js	925 B	-rw-rw-r--	2022-08-30 11:49
IterableHelpers.js	962 B	-rw-rw-r--	2022-08-30 11:49
LazyBucketSortedSet.js	5.6 KB	-rw-rw-r--	2022-08-30 11:49
LazySet.js	4.46 KB	-rw-rw-r--	2022-08-30 11:49
MapHelpers.js	472 B	-rw-rw-r--	2022-08-30 11:49
ParallelismFactorCalculator.js	1.49 KB	-rw-rw-r--	2022-08-30 11:49
Queue.js	1.02 KB	-rw-rw-r--	2022-08-30 11:49
Semaphore.js	1008 B	-rw-rw-r--	2022-08-30 11:49
SetHelpers.js	2.26 KB	-rw-rw-r--	2022-08-30 11:49
SortableSet.js	3.55 KB	-rw-rw-r--	2022-08-30 11:49
StackedCacheMap.js	2.23 KB	-rw-rw-r--	2022-08-30 11:49
StackedMap.js	3.37 KB	-rw-rw-r--	2022-08-30 11:49
StringXor.js	1.09 KB	-rw-rw-r--	2022-08-30 11:49
TupleQueue.js	1.29 KB	-rw-rw-r--	2022-08-30 11:49
TupleSet.js	2.84 KB	-rw-rw-r--	2022-08-30 11:49
URLAbsoluteSpecifier.js	2.49 KB	-rw-rw-r--	2022-08-30 11:49
WeakTupleMap.js	3.36 KB	-rw-rw-r--	2022-08-30 11:49
binarySearchBounds.js	1.86 KB	-rw-rw-r--	2022-08-30 11:49
cleverMerge.js	16.15 KB	-rw-rw-r--	2022-08-30 11:49
comparators.js	12.15 KB	-rw-rw-r--	2022-08-30 11:49
compileBooleanMatcher.js	5.68 KB	-rw-rw-r--	2022-08-30 11:49
create-schema-validation.js	711 B	-rw-rw-r--	2022-08-30 11:49
createHash.js	4.71 KB	-rw-rw-r--	2022-08-30 11:49
deprecation.js	6.3 KB	-rw-rw-r--	2022-08-30 11:49
deterministicGrouping.js	13.44 KB	-rw-rw-r--	2022-08-30 11:49
extractUrlAndGlobal.js	531 B	-rw-rw-r--	2022-08-30 11:49
findGraphRoots.js	5.97 KB	-rw-rw-r--	2022-08-30 11:49
fs.js	11.15 KB	-rw-rw-r--	2022-08-30 11:49
identifier.js	10.79 KB	-rw-rw-r--	2022-08-30 11:49
internalSerializables.js	10.4 KB	-rw-rw-r--	2022-08-30 11:49
makeSerializable.js	640 B	-rw-rw-r--	2022-08-30 11:49
memoize.js	604 B	-rw-rw-r--	2022-08-30 11:49
nonNumericOnlyHash.js	556 B	-rw-rw-r--	2022-08-30 11:49
numberHash.js	1.04 KB	-rw-rw-r--	2022-08-30 11:49
objectToMap.js	346 B	-rw-rw-r--	2022-08-30 11:49
processAsyncTree.js	1.45 KB	-rw-rw-r--	2022-08-30 11:49
propertyAccess.js	1.16 KB	-rw-rw-r--	2022-08-30 11:49
registerExternalSerializer.js	7.73 KB	-rw-rw-r--	2022-08-30 11:49
runtime.js	14.26 KB	-rw-rw-r--	2022-08-30 11:49
semver.js	15.36 KB	-rw-rw-r--	2022-08-30 11:49
serialization.js	3.92 KB	-rw-rw-r--	2022-08-30 11:49
smartGrouping.js	5.15 KB	-rw-rw-r--	2022-08-30 11:49
source.js	1.72 KB	-rw-rw-r--	2022-08-30 11:49

Rename

/*
	MIT License http://www.opensource.org/licenses/mit-license.php
	Author Tobias Koppers @sokra
*/

"use strict";

const TOMBSTONE = Symbol("tombstone");
const UNDEFINED_MARKER = Symbol("undefined");

/**
 * @template T
 * @typedef {T | undefined} Cell<T>
 */

/**
 * @template T
 * @typedef {T | typeof TOMBSTONE | typeof UNDEFINED_MARKER} InternalCell<T>
 */

/**
 * @template K
 * @template V
 * @param {[K, InternalCell<V>]} pair the internal cell
 * @returns {[K, Cell<V>]} its “safe” representation
 */
const extractPair = pair => {
	const key = pair[0];
	const val = pair[1];
	if (val === UNDEFINED_MARKER || val === TOMBSTONE) {
		return [key, undefined];
	} else {
		return /** @type {[K, Cell<V>]} */ (pair);
	}
};

/**
 * @template K
 * @template V
 */
class StackedMap {
	/**
	 * @param {Map<K, InternalCell<V>>[]=} parentStack an optional parent
	 */
	constructor(parentStack) {
		/** @type {Map<K, InternalCell<V>>} */
		this.map = new Map();
		/** @type {Map<K, InternalCell<V>>[]} */
		this.stack = parentStack === undefined ? [] : parentStack.slice();
		this.stack.push(this.map);
	}

/**
	 * @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 === undefined ? UNDEFINED_MARKER : value);
	}

/**
	 * @param {K} item the item to delete
	 * @returns {void}
	 */
	delete(item) {
		if (this.stack.length > 1) {
			this.map.set(item, TOMBSTONE);
		} else {
			this.map.delete(item);
		}
	}

/**
	 * @param {K} item the item to test
	 * @returns {boolean} true if the item exists in this set
	 */
	has(item) {
		const topValue = this.map.get(item);
		if (topValue !== undefined) {
			return topValue !== TOMBSTONE;
		}
		if (this.stack.length > 1) {
			for (let i = this.stack.length - 2; i >= 0; i--) {
				const value = this.stack[i].get(item);
				if (value !== undefined) {
					this.map.set(item, value);
					return value !== TOMBSTONE;
				}
			}
			this.map.set(item, TOMBSTONE);
		}
		return false;
	}

/**
	 * @param {K} item the key of the element to return
	 * @returns {Cell<V>} the value of the element
	 */
	get(item) {
		const topValue = this.map.get(item);
		if (topValue !== undefined) {
			return topValue === TOMBSTONE || topValue === UNDEFINED_MARKER
				? undefined
				: topValue;
		}
		if (this.stack.length > 1) {
			for (let i = this.stack.length - 2; i >= 0; i--) {
				const value = this.stack[i].get(item);
				if (value !== undefined) {
					this.map.set(item, value);
					return value === TOMBSTONE || value === UNDEFINED_MARKER
						? undefined
						: value;
				}
			}
			this.map.set(item, TOMBSTONE);
		}
		return undefined;
	}

_compress() {
		if (this.stack.length === 1) return;
		this.map = new Map();
		for (const data of this.stack) {
			for (const pair of data) {
				if (pair[1] === TOMBSTONE) {
					this.map.delete(pair[0]);
				} else {
					this.map.set(pair[0], pair[1]);
				}
			}
		}
		this.stack = [this.map];
	}

asArray() {
		this._compress();
		return Array.from(this.map.keys());
	}

asSet() {
		this._compress();
		return new Set(this.map.keys());
	}

asPairArray() {
		this._compress();
		return Array.from(this.map.entries(), extractPair);
	}

asMap() {
		return new Map(this.asPairArray());
	}

get size() {
		this._compress();
		return this.map.size;
	}

createChild() {
		return new StackedMap(this.stack);
	}
}

module.exports = StackedMap;