array-to-spliced.js 1.3 KB

1234567891011121314151617181920212223242526272829303132333435
  1. var lengthOfArrayLike = require('../internals/length-of-array-like');
  2. var toAbsoluteIndex = require('../internals/to-absolute-index');
  3. var toIntegerOrInfinity = require('../internals/to-integer-or-infinity');
  4. var max = Math.max;
  5. var min = Math.min;
  6. // https://tc39.es/proposal-change-array-by-copy/#sec-array.prototype.toSpliced
  7. // https://tc39.es/proposal-change-array-by-copy/#sec-%typedarray%.prototype.toSpliced
  8. module.exports = function (O, C, args) {
  9. var start = args[0];
  10. var deleteCount = args[1];
  11. var len = lengthOfArrayLike(O);
  12. var actualStart = toAbsoluteIndex(start, len);
  13. var argumentsLength = args.length;
  14. var k = 0;
  15. var insertCount, actualDeleteCount, newLen, A;
  16. if (argumentsLength === 0) {
  17. insertCount = actualDeleteCount = 0;
  18. } else if (argumentsLength === 1) {
  19. insertCount = 0;
  20. actualDeleteCount = len - actualStart;
  21. } else {
  22. insertCount = argumentsLength - 2;
  23. actualDeleteCount = min(max(toIntegerOrInfinity(deleteCount), 0), len - actualStart);
  24. }
  25. newLen = len + insertCount - actualDeleteCount;
  26. A = new C(newLen);
  27. for (; k < actualStart; k++) A[k] = O[k];
  28. for (; k < actualStart + insertCount; k++) A[k] = args[k - actualStart + 2];
  29. for (; k < newLen; k++) A[k] = O[k + actualDeleteCount - insertCount];
  30. return A;
  31. };