1 | 'use strict';
|
2 |
|
3 | var ArrayBufferViewCore = require('../internals/array-buffer-view-core');
|
4 | var lengthOfArrayLike = require('../internals/length-of-array-like');
|
5 | var isBigIntArray = require('../internals/is-big-int-array');
|
6 | var toAbsoluteIndex = require('../internals/to-absolute-index');
|
7 | var toBigInt = require('../internals/to-big-int');
|
8 | var toIntegerOrInfinity = require('../internals/to-integer-or-infinity');
|
9 | var fails = require('../internals/fails');
|
10 |
|
11 | var aTypedArray = ArrayBufferViewCore.aTypedArray;
|
12 | var getTypedArrayConstructor = ArrayBufferViewCore.getTypedArrayConstructor;
|
13 | var exportTypedArrayMethod = ArrayBufferViewCore.exportTypedArrayMethod;
|
14 | var max = Math.max;
|
15 | var min = Math.min;
|
16 |
|
17 |
|
18 | var PROPER_ORDER = !fails(function () {
|
19 |
|
20 | var array = new Int8Array([1]);
|
21 |
|
22 | var spliced = array.toSpliced(1, 0, {
|
23 | valueOf: function () {
|
24 | array[0] = 2;
|
25 | return 3;
|
26 | }
|
27 | });
|
28 |
|
29 | return spliced[0] !== 2 || spliced[1] !== 3;
|
30 | });
|
31 |
|
32 |
|
33 |
|
34 | exportTypedArrayMethod('toSpliced', function toSpliced(start, deleteCount /* , ...items */) {
|
35 | var O = aTypedArray(this);
|
36 | var C = getTypedArrayConstructor(O);
|
37 | var len = lengthOfArrayLike(O);
|
38 | var actualStart = toAbsoluteIndex(start, len);
|
39 | var argumentsLength = arguments.length;
|
40 | var k = 0;
|
41 | var insertCount, actualDeleteCount, thisIsBigIntArray, convertedItems, value, newLen, A;
|
42 | if (argumentsLength === 0) {
|
43 | insertCount = actualDeleteCount = 0;
|
44 | } else if (argumentsLength === 1) {
|
45 | insertCount = 0;
|
46 | actualDeleteCount = len - actualStart;
|
47 | } else {
|
48 | actualDeleteCount = min(max(toIntegerOrInfinity(deleteCount), 0), len - actualStart);
|
49 | insertCount = argumentsLength - 2;
|
50 | if (insertCount) {
|
51 | convertedItems = new C(insertCount);
|
52 | thisIsBigIntArray = isBigIntArray(convertedItems);
|
53 | for (var i = 2; i < argumentsLength; i++) {
|
54 | value = arguments[i];
|
55 |
|
56 | convertedItems[i - 2] = thisIsBigIntArray ? toBigInt(value) : +value;
|
57 | }
|
58 | }
|
59 | }
|
60 | newLen = len + insertCount - actualDeleteCount;
|
61 | A = new C(newLen);
|
62 |
|
63 | for (; k < actualStart; k++) A[k] = O[k];
|
64 | for (; k < actualStart + insertCount; k++) A[k] = convertedItems[k - actualStart];
|
65 | for (; k < newLen; k++) A[k] = O[k + actualDeleteCount - insertCount];
|
66 |
|
67 | return A;
|
68 | }, !PROPER_ORDER);
|