Gecko [ fernandoquevedodop.com ]

Name	Size	Permission
LazyBucketSortedSet.js	5.58 KB	-rw-r--r--
Queue.js	940 B	-rw-r--r--
Semaphore.js	1007 B	-rw-r--r--
SetHelpers.js	1.34 KB	-rw-r--r--
SortableSet.js	3.16 KB	-rw-r--r--
StackedSetMap.js	2.79 KB	-rw-r--r--
TrackingSet.js	537 B	-rw-r--r--
cachedMerge.js	1.07 KB	-rw-r--r--
cleverMerge.js	2.12 KB	-rw-r--r--
createHash.js	3.31 KB	-rw-r--r--
deterministicGrouping.js	7 KB	-rw-r--r--
identifier.js	3.45 KB	-rw-r--r--
objectToMap.js	405 B	-rw-r--r--

Code Editor : cachedMerge.js

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

const mergeCache = new WeakMap();

/**
 * Merges two given objects and caches the result to avoid computation if same objects passed as arguments again.
 * @example
 * // performs Object.assign(first, second), stores the result in WeakMap and returns result
 * cachedMerge({a: 1}, {a: 2})
 * {a: 2}
 *  // when same arguments passed, gets the result from WeakMap and returns it.
 * cachedMerge({a: 1}, {a: 2})
 * {a: 2}
 * @param {object} first first object
 * @param {object} second second object
 * @returns {object} merged object of first and second object
 */
const cachedMerge = (first, second) => {
	let innerCache = mergeCache.get(first);
	if (innerCache === undefined) {
		innerCache = new WeakMap();
		mergeCache.set(first, innerCache);
	}
	const prevMerge = innerCache.get(second);
	if (prevMerge !== undefined) return prevMerge;
	const newMerge = Object.assign({}, first, second);
	innerCache.set(second, newMerge);
	return newMerge;
};

module.exports = cachedMerge;

${this.title}

Code Editor : cachedMerge.js