You can not select more than 25 topics
			Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
		
		
		
		
		
			
		
			
				
					135 lines
				
				4.3 KiB
			
		
		
			
		
	
	
					135 lines
				
				4.3 KiB
			| 
											3 years ago
										 | /* global Map:readonly, Set:readonly, ArrayBuffer:readonly */ | ||
|  | 
 | ||
|  | var hasElementType = typeof Element !== 'undefined'; | ||
|  | var hasMap = typeof Map === 'function'; | ||
|  | var hasSet = typeof Set === 'function'; | ||
|  | var hasArrayBuffer = typeof ArrayBuffer === 'function' && !!ArrayBuffer.isView; | ||
|  | 
 | ||
|  | // Note: We **don't** need `envHasBigInt64Array` in fde es6/index.js
 | ||
|  | 
 | ||
|  | function equal(a, b) { | ||
|  |   // START: fast-deep-equal es6/index.js 3.1.1
 | ||
|  |   if (a === b) return true; | ||
|  | 
 | ||
|  |   if (a && b && typeof a == 'object' && typeof b == 'object') { | ||
|  |     if (a.constructor !== b.constructor) return false; | ||
|  | 
 | ||
|  |     var length, i, keys; | ||
|  |     if (Array.isArray(a)) { | ||
|  |       length = a.length; | ||
|  |       if (length != b.length) return false; | ||
|  |       for (i = length; i-- !== 0;) | ||
|  |         if (!equal(a[i], b[i])) return false; | ||
|  |       return true; | ||
|  |     } | ||
|  | 
 | ||
|  |     // START: Modifications:
 | ||
|  |     // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code
 | ||
|  |     //    to co-exist with es5.
 | ||
|  |     // 2. Replace `for of` with es5 compliant iteration using `for`.
 | ||
|  |     //    Basically, take:
 | ||
|  |     //
 | ||
|  |     //    ```js
 | ||
|  |     //    for (i of a.entries())
 | ||
|  |     //      if (!b.has(i[0])) return false;
 | ||
|  |     //    ```
 | ||
|  |     //
 | ||
|  |     //    ... and convert to:
 | ||
|  |     //
 | ||
|  |     //    ```js
 | ||
|  |     //    it = a.entries();
 | ||
|  |     //    while (!(i = it.next()).done)
 | ||
|  |     //      if (!b.has(i.value[0])) return false;
 | ||
|  |     //    ```
 | ||
|  |     //
 | ||
|  |     //    **Note**: `i` access switches to `i.value`.
 | ||
|  |     var it; | ||
|  |     if (hasMap && (a instanceof Map) && (b instanceof Map)) { | ||
|  |       if (a.size !== b.size) return false; | ||
|  |       it = a.entries(); | ||
|  |       while (!(i = it.next()).done) | ||
|  |         if (!b.has(i.value[0])) return false; | ||
|  |       it = a.entries(); | ||
|  |       while (!(i = it.next()).done) | ||
|  |         if (!equal(i.value[1], b.get(i.value[0]))) return false; | ||
|  |       return true; | ||
|  |     } | ||
|  | 
 | ||
|  |     if (hasSet && (a instanceof Set) && (b instanceof Set)) { | ||
|  |       if (a.size !== b.size) return false; | ||
|  |       it = a.entries(); | ||
|  |       while (!(i = it.next()).done) | ||
|  |         if (!b.has(i.value[0])) return false; | ||
|  |       return true; | ||
|  |     } | ||
|  |     // END: Modifications
 | ||
|  | 
 | ||
|  |     if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) { | ||
|  |       length = a.length; | ||
|  |       if (length != b.length) return false; | ||
|  |       for (i = length; i-- !== 0;) | ||
|  |         if (a[i] !== b[i]) return false; | ||
|  |       return true; | ||
|  |     } | ||
|  | 
 | ||
|  |     if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags; | ||
|  |     if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf(); | ||
|  |     if (a.toString !== Object.prototype.toString) return a.toString() === b.toString(); | ||
|  | 
 | ||
|  |     keys = Object.keys(a); | ||
|  |     length = keys.length; | ||
|  |     if (length !== Object.keys(b).length) return false; | ||
|  | 
 | ||
|  |     for (i = length; i-- !== 0;) | ||
|  |       if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false; | ||
|  |     // END: fast-deep-equal
 | ||
|  | 
 | ||
|  |     // START: react-fast-compare
 | ||
|  |     // custom handling for DOM elements
 | ||
|  |     if (hasElementType && a instanceof Element) return false; | ||
|  | 
 | ||
|  |     // custom handling for React/Preact
 | ||
|  |     for (i = length; i-- !== 0;) { | ||
|  |       if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) { | ||
|  |         // React-specific: avoid traversing React elements' _owner
 | ||
|  |         // Preact-specific: avoid traversing Preact elements' __v and __o
 | ||
|  |         //    __v = $_original / $_vnode
 | ||
|  |         //    __o = $_owner
 | ||
|  |         // These properties contain circular references and are not needed when
 | ||
|  |         // comparing the actual elements (and not their owners)
 | ||
|  |         // .$$typeof and ._store on just reasonable markers of elements
 | ||
|  | 
 | ||
|  |         continue; | ||
|  |       } | ||
|  | 
 | ||
|  |       // all other properties should be traversed as usual
 | ||
|  |       if (!equal(a[keys[i]], b[keys[i]])) return false; | ||
|  |     } | ||
|  |     // END: react-fast-compare
 | ||
|  | 
 | ||
|  |     // START: fast-deep-equal
 | ||
|  |     return true; | ||
|  |   } | ||
|  | 
 | ||
|  |   return a !== a && b !== b; | ||
|  | } | ||
|  | // end fast-deep-equal
 | ||
|  | 
 | ||
|  | module.exports = function isEqual(a, b) { | ||
|  |   try { | ||
|  |     return equal(a, b); | ||
|  |   } catch (error) { | ||
|  |     if (((error.message || '').match(/stack|recursion/i))) { | ||
|  |       // warn on circular references, don't crash
 | ||
|  |       // browsers give this different errors name and messages:
 | ||
|  |       // chrome/safari: "RangeError", "Maximum call stack size exceeded"
 | ||
|  |       // firefox: "InternalError", too much recursion"
 | ||
|  |       // edge: "Error", "Out of stack space"
 | ||
|  |       console.warn('react-fast-compare cannot handle circular refs'); | ||
|  |       return false; | ||
|  |     } | ||
|  |     // some other error. we should definitely know about these
 | ||
|  |     throw error; | ||
|  |   } | ||
|  | }; |