first commit

build/node_modules/prepack/lib/intrinsics/ecma262/isFinite.js

@@ -0,0 +1,36 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+
+var _slicedToArray = function () { function sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"]) _i["return"](); } finally { if (_d) throw _e; } } return _arr; } return function (arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }; }(); /**
+                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          * Copyright (c) 2017-present, Facebook, Inc.
+                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          * All rights reserved.
+                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          *
+                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          * This source code is licensed under the BSD-style license found in the
+                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          * LICENSE file in the root directory of this source tree. An additional grant
+                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          * of patent rights can be found in the PATENTS file in the same directory.
+                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          */
+
+exports.default = function (realm) {
+  // ECMA262 18.2.2
+  return new _index.NativeFunctionValue(realm, "isFinite", "isFinite", 1, function (context, _ref) {
+    var _ref2 = _slicedToArray(_ref, 1),
+        number = _ref2[0];
+
+    // 1. Let num be ? ToNumber(number).
+    var num = _singletons.To.ToNumber(realm, number);
+
+    // 2. If num is NaN, +∞, or -∞, return false.
+    if (isNaN(num) || num === +Infinity || num === -Infinity) return realm.intrinsics.false;
+
+    // 3. Otherwise, return true.
+    return realm.intrinsics.true;
+  }, false);
+};
+
+var _index = require("../../values/index.js");
+
+var _singletons = require("../../singletons.js");
+//# sourceMappingURL=isFinite.js.map