aboutsummaryrefslogtreecommitdiff
path: root/node_modules/fbjs/lib/areEqual.js.flow
diff options
context:
space:
mode:
authorFlorian Dold <florian.dold@gmail.com>2018-09-20 02:56:13 +0200
committerFlorian Dold <florian.dold@gmail.com>2018-09-20 02:56:13 +0200
commitbbff7403fbf46f9ad92240ac213df8d30ef31b64 (patch)
treec58400ec5124da1c7d56b01aea83309f80a56c3b /node_modules/fbjs/lib/areEqual.js.flow
parent003fb34971cf63466184351b4db5f7c67df4f444 (diff)
update packages
Diffstat (limited to 'node_modules/fbjs/lib/areEqual.js.flow')
-rw-r--r--node_modules/fbjs/lib/areEqual.js.flow105
1 files changed, 0 insertions, 105 deletions
diff --git a/node_modules/fbjs/lib/areEqual.js.flow b/node_modules/fbjs/lib/areEqual.js.flow
deleted file mode 100644
index 06e53ec65..000000000
--- a/node_modules/fbjs/lib/areEqual.js.flow
+++ /dev/null
@@ -1,105 +0,0 @@
-/**
- * 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.
- *
- * @providesModule areEqual
- * @flow
- */
-
-const aStackPool = [];
-const 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: any, b: any): boolean {
- const aStack = aStackPool.length ? aStackPool.pop() : [];
- const bStack = bStackPool.length ? bStackPool.pop() : [];
- const result = eq(a, b, aStack, bStack);
- aStack.length = 0;
- bStack.length = 0;
- aStackPool.push(aStack);
- bStackPool.push(bStack);
- return result;
-}
-
-function eq(a: any, b: any, aStack: Array<any>, bStack: Array<any>): boolean {
- if (a === b) {
- // Identical objects are equal. `0 === -0`, but they aren't identical.
- return a !== 0 || 1 / a == 1 / b;
- }
- if (a == null || b == null) {
- // a or b can be `null` or `undefined`
- return false;
- }
- if (typeof a != 'object' || typeof b != 'object') {
- return false;
- }
- const objToStr = Object.prototype.toString;
- const 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;
- }
- // Assume equality for cyclic structures.
- let length = aStack.length;
- while (length--) {
- if (aStack[length] == a) {
- return bStack[length] == b;
- }
- }
- aStack.push(a);
- bStack.push(b);
- let size = 0;
- // Recursively compare objects and arrays.
- if (className === '[object Array]') {
- size = a.length;
- if (size !== b.length) {
- return false;
- }
- // Deep compare the contents, ignoring non-numeric properties.
- 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();
- }
- const keys = Object.keys(a);
- if (keys.length != Object.keys(b).length) {
- return false;
- }
- for (let 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; \ No newline at end of file