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 isWeakKey = thing => typeof thing === "object" && thing !== null;

/**
 * @template {any[]} T
 * @template V
 */
class WeakTupleMap {
	constructor() {
		/** @private */
		this.f = 0;
		/** @private @type {any} */
		this.v = undefined;
		/** @private @type {Map<object, WeakTupleMap<T, V>> | undefined} */
		this.m = undefined;
		/** @private @type {WeakMap<object, WeakTupleMap<T, V>> | undefined} */
		this.w = undefined;
	}

/**
	 * @param {[...T, V]} args tuple
	 * @returns {void}
	 */
	set(...args) {
		/** @type {WeakTupleMap<T, V>} */
		let node = this;
		for (let i = 0; i < args.length - 1; i++) {
			node = node._get(args[i]);
		}
		node._setValue(args[args.length - 1]);
	}

/**
	 * @param {T} args tuple
	 * @returns {boolean} true, if the tuple is in the Set
	 */
	has(...args) {
		/** @type {WeakTupleMap<T, V>} */
		let node = this;
		for (let i = 0; i < args.length; i++) {
			node = node._peek(args[i]);
			if (node === undefined) return false;
		}
		return node._hasValue();
	}

/**
	 * @param {T} args tuple
	 * @returns {V} the value
	 */
	get(...args) {
		/** @type {WeakTupleMap<T, V>} */
		let node = this;
		for (let i = 0; i < args.length; i++) {
			node = node._peek(args[i]);
			if (node === undefined) return undefined;
		}
		return node._getValue();
	}

/**
	 * @param {[...T, function(): V]} args tuple
	 * @returns {V} the value
	 */
	provide(...args) {
		/** @type {WeakTupleMap<T, V>} */
		let node = this;
		for (let i = 0; i < args.length - 1; i++) {
			node = node._get(args[i]);
		}
		if (node._hasValue()) return node._getValue();
		const fn = args[args.length - 1];
		const newValue = fn(...args.slice(0, -1));
		node._setValue(newValue);
		return newValue;
	}

/**
	 * @param {T} args tuple
	 * @returns {void}
	 */
	delete(...args) {
		/** @type {WeakTupleMap<T, V>} */
		let node = this;
		for (let i = 0; i < args.length; i++) {
			node = node._peek(args[i]);
			if (node === undefined) return;
		}
		node._deleteValue();
	}

/**
	 * @returns {void}
	 */
	clear() {
		this.f = 0;
		this.v = undefined;
		this.w = undefined;
		this.m = undefined;
	}

_getValue() {
		return this.v;
	}

_hasValue() {
		return (this.f & 1) === 1;
	}

_setValue(v) {
		this.f |= 1;
		this.v = v;
	}

_deleteValue() {
		this.f &= 6;
		this.v = undefined;
	}

_peek(thing) {
		if (isWeakKey(thing)) {
			if ((this.f & 4) !== 4) return undefined;
			return this.w.get(thing);
		} else {
			if ((this.f & 2) !== 2) return undefined;
			return this.m.get(thing);
		}
	}

_get(thing) {
		if (isWeakKey(thing)) {
			if ((this.f & 4) !== 4) {
				const newMap = new WeakMap();
				this.f |= 4;
				const newNode = new WeakTupleMap();
				(this.w = newMap).set(thing, newNode);
				return newNode;
			}
			const entry = this.w.get(thing);
			if (entry !== undefined) {
				return entry;
			}
			const newNode = new WeakTupleMap();
			this.w.set(thing, newNode);
			return newNode;
		} else {
			if ((this.f & 2) !== 2) {
				const newMap = new Map();
				this.f |= 2;
				const newNode = new WeakTupleMap();
				(this.m = newMap).set(thing, newNode);
				return newNode;
			}
			const entry = this.m.get(thing);
			if (entry !== undefined) {
				return entry;
			}
			const newNode = new WeakTupleMap();
			this.m.set(thing, newNode);
			return newNode;
		}
	}
}

module.exports = WeakTupleMap;