forked from clientIO/joint
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
polyfills: replace with core-js (clientIO#1416)
- Loading branch information
Showing
5 changed files
with
16 additions
and
250 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
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 |
|---|---|---|
| @@ -1,220 +1,4 @@ | ||
| // https://tc39.github.io/ecma262/#sec-array.prototype.includes | ||
| if (!Array.prototype.includes) { | ||
| Object.defineProperty(Array.prototype, 'includes', { | ||
| value: function(searchElement, fromIndex) { | ||
|
|
||
| // 1. Let O be ? ToObject(this value). | ||
| if (this == null) { | ||
| throw new TypeError('"this" is null or not defined'); | ||
| } | ||
|
|
||
| var o = Object(this); | ||
|
|
||
| // 2. Let len be ? ToLength(? Get(O, "length")). | ||
| var len = o.length >>> 0; | ||
|
|
||
| // 3. If len is 0, return false. | ||
| if (len === 0) { | ||
| return false; | ||
| } | ||
|
|
||
| // 4. Let n be ? ToInteger(fromIndex). | ||
| // (If fromIndex is undefined, this step produces the value 0.) | ||
| var n = fromIndex | 0; | ||
|
|
||
| // 5. If n ≥ 0, then | ||
| // a. Let k be n. | ||
| // 6. Else n < 0, | ||
| // a. Let k be len + n. | ||
| // b. If k < 0, let k be 0. | ||
| var k = Math.max(n >= 0 ? n : len - Math.abs(n), 0); | ||
|
|
||
| function sameValueZero(x, y) { | ||
| return x === y || (typeof x === 'number' && typeof y === 'number' && isNaN(x) && isNaN(y)); | ||
| } | ||
|
|
||
| // 7. Repeat, while k < len | ||
| while (k < len) { | ||
| // a. Let elementK be the result of ? Get(O, ! ToString(k)). | ||
| // b. If SameValueZero(searchElement, elementK) is true, return true. | ||
| // c. Increase k by 1. | ||
| if (sameValueZero(o[k], searchElement)) { | ||
| return true; | ||
| } | ||
| k++; | ||
| } | ||
|
|
||
| // 8. Return false | ||
| return false; | ||
| } | ||
| }); | ||
| } | ||
|
|
||
| // https://tc39.github.io/ecma262/#sec-array.prototype.find | ||
| if (!Array.prototype.find) { | ||
| Object.defineProperty(Array.prototype, 'find', { | ||
| value: function(predicate) { | ||
| // 1. Let O be ? ToObject(this value). | ||
| if (this == null) { | ||
| throw new TypeError('"this" is null or not defined'); | ||
| } | ||
|
|
||
| var o = Object(this); | ||
|
|
||
| // 2. Let len be ? ToLength(? Get(O, "length")). | ||
| var len = o.length >>> 0; | ||
|
|
||
| // 3. If IsCallable(predicate) is false, throw a TypeError exception. | ||
| if (typeof predicate !== 'function') { | ||
| throw new TypeError('predicate must be a function'); | ||
| } | ||
|
|
||
| // 4. If thisArg was supplied, let T be thisArg; else let T be undefined. | ||
| var thisArg = arguments[1]; | ||
|
|
||
| // 5. Let k be 0. | ||
| var k = 0; | ||
|
|
||
| // 6. Repeat, while k < len | ||
| while (k < len) { | ||
| // a. Let Pk be ! ToString(k). | ||
| // b. Let kValue be ? Get(O, Pk). | ||
| // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)). | ||
| // d. If testResult is true, return kValue. | ||
| var kValue = o[k]; | ||
| if (predicate.call(thisArg, kValue, k, o)) { | ||
| return kValue; | ||
| } | ||
| // e. Increase k by 1. | ||
| k++; | ||
| } | ||
|
|
||
| // 7. Return undefined. | ||
| return undefined; | ||
| } | ||
| }); | ||
| } | ||
|
|
||
| // Production steps of ECMA-262, Edition 6, 22.1.2.1 | ||
| if (!Array.from) { | ||
| Array.from = (function() { | ||
| var toStr = Object.prototype.toString; | ||
| var isCallable = function(fn) { | ||
| return typeof fn === 'function' || toStr.call(fn) === '[object Function]'; | ||
| }; | ||
| var toInteger = function(value) { | ||
| var number = Number(value); | ||
| if (isNaN(number)) { return 0; } | ||
| if (number === 0 || !isFinite(number)) { return number; } | ||
| return (number > 0 ? 1 : -1) * Math.floor(Math.abs(number)); | ||
| }; | ||
| var maxSafeInteger = Math.pow(2, 53) - 1; | ||
| var toLength = function(value) { | ||
| var len = toInteger(value); | ||
| return Math.min(Math.max(len, 0), maxSafeInteger); | ||
| }; | ||
|
|
||
| // The length property of the from method is 1. | ||
| return function from(arrayLike/*, mapFn, thisArg */) { | ||
| // 1. Let C be the this value. | ||
| var C = this; | ||
|
|
||
| // 2. Let items be ToObject(arrayLike). | ||
| var items = Object(arrayLike); | ||
|
|
||
| // 3. ReturnIfAbrupt(items). | ||
| if (arrayLike == null) { | ||
| throw new TypeError('Array.from requires an array-like object - not null or undefined'); | ||
| } | ||
|
|
||
| // 4. If mapfn is undefined, then let mapping be false. | ||
| var mapFn = arguments.length > 1 ? arguments[1] : void undefined; | ||
| var T; | ||
| if (typeof mapFn !== 'undefined') { | ||
| // 5. else | ||
| // 5. a If IsCallable(mapfn) is false, throw a TypeError exception. | ||
| if (!isCallable(mapFn)) { | ||
| throw new TypeError('Array.from: when provided, the second argument must be a function'); | ||
| } | ||
|
|
||
| // 5. b. If thisArg was supplied, let T be thisArg; else let T be undefined. | ||
| if (arguments.length > 2) { | ||
| T = arguments[2]; | ||
| } | ||
| } | ||
|
|
||
| // 10. Let lenValue be Get(items, "length"). | ||
| // 11. Let len be ToLength(lenValue). | ||
| var len = toLength(items.length); | ||
|
|
||
| // 13. If IsConstructor(C) is true, then | ||
| // 13. a. Let A be the result of calling the [[Construct]] internal method | ||
| // of C with an argument list containing the single item len. | ||
| // 14. a. Else, Let A be ArrayCreate(len). | ||
| var A = isCallable(C) ? Object(new C(len)) : new Array(len); | ||
|
|
||
| // 16. Let k be 0. | ||
| var k = 0; | ||
| // 17. Repeat, while k < len… (also steps a - h) | ||
| var kValue; | ||
| while (k < len) { | ||
| kValue = items[k]; | ||
| if (mapFn) { | ||
| A[k] = typeof T === 'undefined' ? mapFn(kValue, k) : mapFn.call(T, kValue, k); | ||
| } else { | ||
| A[k] = kValue; | ||
| } | ||
| k += 1; | ||
| } | ||
| // 18. Let putStatus be Put(A, "length", len, true). | ||
| A.length = len; | ||
| // 20. Return A. | ||
| return A; | ||
| }; | ||
| }()); | ||
| } | ||
|
|
||
| // https://tc39.github.io/ecma262/#sec-array.prototype.findIndex | ||
| if (!Array.prototype.findIndex) { | ||
| Object.defineProperty(Array.prototype, 'findIndex', { | ||
| value: function(predicate) { | ||
| // 1. Let O be ? ToObject(this value). | ||
| if (this == null) { | ||
| throw new TypeError('"this" is null or not defined'); | ||
| } | ||
|
|
||
| var o = Object(this); | ||
|
|
||
| // 2. Let len be ? ToLength(? Get(O, "length")). | ||
| var len = o.length >>> 0; | ||
|
|
||
| // 3. If IsCallable(predicate) is false, throw a TypeError exception. | ||
| if (typeof predicate !== 'function') { | ||
| throw new TypeError('predicate must be a function'); | ||
| } | ||
|
|
||
| // 4. If thisArg was supplied, let T be thisArg; else let T be undefined. | ||
| var thisArg = arguments[1]; | ||
|
|
||
| // 5. Let k be 0. | ||
| var k = 0; | ||
|
|
||
| // 6. Repeat, while k < len | ||
| while (k < len) { | ||
| // a. Let Pk be ! ToString(k). | ||
| // b. Let kValue be ? Get(O, Pk). | ||
| // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)). | ||
| // d. If testResult is true, return k. | ||
| var kValue = o[k]; | ||
| if (predicate.call(thisArg, kValue, k, o)) { | ||
| return k; | ||
| } | ||
| // e. Increase k by 1. | ||
| k++; | ||
| } | ||
|
|
||
| // 7. Return -1. | ||
| return -1; | ||
| } | ||
| }); | ||
| } | ||
| import 'core-js/stable/array/includes'; | ||
| import 'core-js/stable/array/find'; | ||
| import 'core-js/stable/array/from'; | ||
| import 'core-js/stable/array/find-index'; |
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 |
|---|---|---|
| @@ -1,9 +1,3 @@ | ||
| Number.isFinite = Number.isFinite || function(value) { | ||
| return typeof value === 'number' && isFinite(value); | ||
| }; | ||
|
|
||
| //The following works because NaN is the only value in javascript which is not equal to itself. | ||
| Number.isNaN = Number.isNaN || function(value) { | ||
| return value !== value; | ||
| }; | ||
| import 'core-js/stable/number/is-nan'; | ||
| import 'core-js/stable/number/is-finite'; | ||
|
|
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 |
|---|---|---|
| @@ -1,20 +1,3 @@ | ||
| if (!String.prototype.includes) { | ||
| String.prototype.includes = function(search, start) { | ||
| 'use strict'; | ||
| if (typeof start !== 'number') { | ||
| start = 0; | ||
| } | ||
| import 'core-js/stable/string/includes'; | ||
| import 'core-js/stable/string/starts-with'; | ||
|
|
||
| if (start + search.length > this.length) { | ||
| return false; | ||
| } else { | ||
| return this.indexOf(search, start) !== -1; | ||
| } | ||
| }; | ||
| } | ||
|
|
||
| if (!String.prototype.startsWith) { | ||
| String.prototype.startsWith = function(searchString, position){ | ||
| return this.substr(position || 0, searchString.length) === searchString; | ||
| }; | ||
| } |