@drfed/web 0.0.0-stage → 0.1.0-dev.561

package/.output/server/_libs/fbjs.mjs

@@ -0,0 +1,115 @@
+import { t as __commonJSMin } from "../_runtime.mjs";
+//#region ../../node_modules/.pnpm/fbjs@3.0.5/node_modules/fbjs/lib/emptyFunction.js
+var require_emptyFunction = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	/**
+	* Copyright (c) 2013-present, Facebook, Inc.
+	*
+	* This source code is licensed under the MIT license found in the
+	* LICENSE file in the root directory of this source tree.
+	*
+	* 
+	*/
+	function makeEmptyFunction(arg) {
+		return function() {
+			return arg;
+		};
+	}
+	/**
+	* This function accepts and discards inputs; it has no side effects. This is
+	* primarily useful idiomatically for overridable function endpoints which
+	* always need to be callable, since JS lacks a null-call idiom ala Cocoa.
+	*/
+	var emptyFunction = function emptyFunction() {};
+	emptyFunction.thatReturns = makeEmptyFunction;
+	emptyFunction.thatReturnsFalse = makeEmptyFunction(false);
+	emptyFunction.thatReturnsTrue = makeEmptyFunction(true);
+	emptyFunction.thatReturnsNull = makeEmptyFunction(null);
+	emptyFunction.thatReturnsThis = function() {
+		return this;
+	};
+	emptyFunction.thatReturnsArgument = function(arg) {
+		return arg;
+	};
+	module.exports = emptyFunction;
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/fbjs@3.0.5/node_modules/fbjs/lib/warning.js
+/**
+* Copyright (c) 2014-present, Facebook, Inc.
+*
+* This source code is licensed under the MIT license found in the
+* LICENSE file in the root directory of this source tree.
+*
+*/
+var require_warning = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	module.exports = require_emptyFunction();
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/fbjs@3.0.5/node_modules/fbjs/lib/areEqual.js
+var require_areEqual = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	/**
+	* Copyright (c) 2013-present, Facebook, Inc.
+	*
+	* This source code is licensed under the MIT license found in the
+	* LICENSE file in the root directory of this source tree.
+	*
+	* 
+	*/
+	var aStackPool = [];
+	var bStackPool = [];
+	/**
+	* Checks if two values are equal. Values may be primitives, arrays, or objects.
+	* Returns true if both arguments have the same keys and values.
+	*
+	* @see http://underscorejs.org
+	* @copyright 2009-2013 Jeremy Ashkenas, DocumentCloud Inc.
+	* @license MIT
+	*/
+	function areEqual(a, b) {
+		var aStack = aStackPool.length ? aStackPool.pop() : [];
+		var bStack = bStackPool.length ? bStackPool.pop() : [];
+		var result = eq(a, b, aStack, bStack);
+		aStack.length = 0;
+		bStack.length = 0;
+		aStackPool.push(aStack);
+		bStackPool.push(bStack);
+		return result;
+	}
+	function eq(a, b, aStack, bStack) {
+		if (a === b) return a !== 0 || 1 / a == 1 / b;
+		if (a == null || b == null) return false;
+		if (typeof a != "object" || typeof b != "object") return false;
+		var objToStr = Object.prototype.toString;
+		var className = objToStr.call(a);
+		if (className != objToStr.call(b)) return false;
+		switch (className) {
+			case "[object String]": return a == String(b);
+			case "[object Number]": return isNaN(a) || isNaN(b) ? false : a == Number(b);
+			case "[object Date]":
+			case "[object Boolean]": return +a == +b;
+			case "[object RegExp]": return a.source == b.source && a.global == b.global && a.multiline == b.multiline && a.ignoreCase == b.ignoreCase;
+		}
+		var length = aStack.length;
+		while (length--) if (aStack[length] == a) return bStack[length] == b;
+		aStack.push(a);
+		bStack.push(b);
+		var size = 0;
+		if (className === "[object Array]") {
+			size = a.length;
+			if (size !== b.length) return false;
+			while (size--) if (!eq(a[size], b[size], aStack, bStack)) return false;
+		} else {
+			if (a.constructor !== b.constructor) return false;
+			if (a.hasOwnProperty("valueOf") && b.hasOwnProperty("valueOf")) return a.valueOf() == b.valueOf();
+			var keys = Object.keys(a);
+			if (keys.length != Object.keys(b).length) return false;
+			for (var i = 0; i < keys.length; i++) if (!eq(a[keys[i]], b[keys[i]], aStack, bStack)) return false;
+		}
+		aStack.pop();
+		bStack.pop();
+		return true;
+	}
+	module.exports = areEqual;
+}));
+//#endregion
+export { require_warning as n, require_areEqual as t };