Gecko [ gandhischool.edu.np ]

Name	Size	Permission
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-

Code Editor : WeakTupleMap.js

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

"use strict";

/**
 * @template {any[]} T
 * @template V
 * @typedef {Map<object, WeakTupleMap<T, V>>} M
 */
/**
 * @template {any[]} T
 * @template V
 * @typedef {WeakMap<object, WeakTupleMap<T, V>>} W
 */

/**
 * @param {any} thing thing
 * @returns {boolean} true if is weak
 */
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 {M<T, V> | undefined}
		 */
		this.m = undefined;
		/**
		 * @private
		 * @type {W<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> | undefined} */
		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 | undefined} the value
	 */
	get(...args) {
		/** @type {WeakTupleMap<T, V> | undefined} */
		let node = this;
		for (let i = 0; i < args.length; i++) {
			node = node._peek(args[i]);
			if (node === undefined) return;
		}
		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> | undefined} */
		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;
	}

/**
	 * @param {any} v value
	 * @private
	 */
	_setValue(v) {
		this.f |= 1;
		this.v = v;
	}

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

/**
	 * @param {any} thing thing
	 * @returns {WeakTupleMap<T, V> | undefined} thing
	 * @private
	 */
	_peek(thing) {
		if (isWeakKey(thing)) {
			if ((this.f & 4) !== 4) return;
			return /** @type {W<T, V>} */ (this.w).get(thing);
		}
		if ((this.f & 2) !== 2) return;
		return /** @type {M<T, V>} */ (this.m).get(thing);
	}

/**
	 * @private
	 * @param {any} thing thing
	 * @returns {WeakTupleMap<T, V>} value
	 */
	_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 =
				/** @type {W<T, V>} */
				(this.w).get(thing);
			if (entry !== undefined) {
				return entry;
			}
			const newNode = new WeakTupleMap();
			/** @type {W<T, V>} */
			(this.w).set(thing, newNode);
			return newNode;
		}
		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 =
			/** @type {M<T, V>} */
			(this.m).get(thing);
		if (entry !== undefined) {
			return entry;
		}
		const newNode = new WeakTupleMap();
		/** @type {M<T, V>} */
		(this.m).set(thing, newNode);
		return newNode;
	}
}

module.exports = WeakTupleMap;

${this.title}

Code Editor : WeakTupleMap.js