-
Notifications
You must be signed in to change notification settings - Fork 4
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
5 changed files
with
330 additions
and
219 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,66 @@ | ||
/** | ||
* 检查两个对象是否相等 | ||
* @param a | ||
* @param b | ||
*/ | ||
function equal(a: any, b: any): boolean { | ||
if (a === b) return true; | ||
|
||
if (a && b && typeof a == 'object' && typeof b == 'object') { | ||
if (a.constructor !== b.constructor) return false; | ||
|
||
let 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; | ||
} | ||
|
||
if (a instanceof Map && b instanceof Map) { | ||
if (a.size !== b.size) return false; | ||
for (i of a.entries()) if (!b.has(i[0])) return false; | ||
for (i of a.entries()) if (!equal(i[1], b.get(i[0]))) return false; | ||
return true; | ||
} | ||
|
||
if (a instanceof Set && b instanceof Set) { | ||
if (a.size !== b.size) return false; | ||
for (i of a.entries()) if (!b.has(i[0])) return false; | ||
return true; | ||
} | ||
|
||
if (ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) { | ||
// @ts-ignore | ||
length = a.length; | ||
// @ts-ignore | ||
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(); | ||
|
||
// eslint-disable-next-line prefer-const | ||
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; | ||
|
||
for (i = length; i-- !== 0; ) { | ||
const key = keys[i]; | ||
|
||
if (!equal(a[key], b[key])) return false; | ||
} | ||
|
||
return true; | ||
} | ||
|
||
return a !== a && b !== b; | ||
} | ||
|
||
export default equal; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.