| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -761,7 +761,7 @@ function setEquiv(a, b, mode, memo) { | |||
| 761 | 761 | // If the specified value doesn't exist in the second set it's a object | |
| 762 | 762 | // (or in loose mode: a non-matching primitive). Find the | |
| 763 | 763 | // deep-(mode-)equal element in a set copy to reduce duplicate checks. | |
| 764 | - array.push(val); | ||
| 764 | + ArrayPrototypePush(array, val); | ||
| 765 | 765 | } | |
| 766 | 766 | } | |
| 767 | 767 | ||
@@ -891,7 +891,7 @@ function mapEquiv(a, b, mode, memo) { | |||
| 891 | 891 | } | |
| 892 | 892 | array = []; | |
| 893 | 893 | } | |
| 894 | - array.push(key2); | ||
| 894 | + ArrayPrototypePush(array, key2); | ||
| 895 | 895 | } else { | |
| 896 | 896 | // By directly retrieving the value we prevent another b.has(key2) check in | |
| 897 | 897 | // almost all possible cases. | |
@@ -907,7 +907,7 @@ function mapEquiv(a, b, mode, memo) { | |||
| 907 | 907 | if (array === undefined) { | |
| 908 | 908 | array = []; | |
| 909 | 909 | } | |
| 910 | - array.push(key2); | ||
| 910 | + ArrayPrototypePush(array, key2); | ||
| 911 | 911 | } | |
| 912 | 912 | } | |
| 913 | 913 | } | |
| Back | FazBrowse Home | New Git URL |
0 commit comments