1 | 'use strict';
|
2 | var $ = require('../internals/export');
|
3 | var toAbsoluteIndex = require('../internals/to-absolute-index');
|
4 | var toInteger = require('../internals/to-integer');
|
5 | var toLength = require('../internals/to-length');
|
6 | var toObject = require('../internals/to-object');
|
7 | var arraySpeciesCreate = require('../internals/array-species-create');
|
8 | var createProperty = require('../internals/create-property');
|
9 | var arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');
|
10 |
|
11 | var max = Math.max;
|
12 | var min = Math.min;
|
13 | var MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF;
|
14 | var MAXIMUM_ALLOWED_LENGTH_EXCEEDED = 'Maximum allowed length exceeded';
|
15 |
|
16 |
|
17 |
|
18 |
|
19 | $({ target: 'Array', proto: true, forced: !arrayMethodHasSpeciesSupport('splice') }, {
|
20 | splice: function splice(start, deleteCount /* , ...items */) {
|
21 | var O = toObject(this);
|
22 | var len = toLength(O.length);
|
23 | var actualStart = toAbsoluteIndex(start, len);
|
24 | var argumentsLength = arguments.length;
|
25 | var insertCount, actualDeleteCount, A, k, from, to;
|
26 | if (argumentsLength === 0) {
|
27 | insertCount = actualDeleteCount = 0;
|
28 | } else if (argumentsLength === 1) {
|
29 | insertCount = 0;
|
30 | actualDeleteCount = len - actualStart;
|
31 | } else {
|
32 | insertCount = argumentsLength - 2;
|
33 | actualDeleteCount = min(max(toInteger(deleteCount), 0), len - actualStart);
|
34 | }
|
35 | if (len + insertCount - actualDeleteCount > MAX_SAFE_INTEGER) {
|
36 | throw TypeError(MAXIMUM_ALLOWED_LENGTH_EXCEEDED);
|
37 | }
|
38 | A = arraySpeciesCreate(O, actualDeleteCount);
|
39 | for (k = 0; k < actualDeleteCount; k++) {
|
40 | from = actualStart + k;
|
41 | if (from in O) createProperty(A, k, O[from]);
|
42 | }
|
43 | A.length = actualDeleteCount;
|
44 | if (insertCount < actualDeleteCount) {
|
45 | for (k = actualStart; k < len - actualDeleteCount; k++) {
|
46 | from = k + actualDeleteCount;
|
47 | to = k + insertCount;
|
48 | if (from in O) O[to] = O[from];
|
49 | else delete O[to];
|
50 | }
|
51 | for (k = len; k > len - actualDeleteCount + insertCount; k--) delete O[k - 1];
|
52 | } else if (insertCount > actualDeleteCount) {
|
53 | for (k = len - actualDeleteCount; k > actualStart; k--) {
|
54 | from = k + actualDeleteCount - 1;
|
55 | to = k + insertCount - 1;
|
56 | if (from in O) O[to] = O[from];
|
57 | else delete O[to];
|
58 | }
|
59 | }
|
60 | for (k = 0; k < insertCount; k++) {
|
61 | O[k + actualStart] = arguments[k + 2];
|
62 | }
|
63 | O.length = len - actualDeleteCount + insertCount;
|
64 | return A;
|
65 | }
|
66 | });
|