2 var $ = require('../internals/export');
3 var global = require('../internals/global');
4 var toAbsoluteIndex = require('../internals/to-absolute-index');
5 var toIntegerOrInfinity = require('../internals/to-integer-or-infinity');
6 var lengthOfArrayLike = require('../internals/length-of-array-like');
7 var toObject = require('../internals/to-object');
8 var arraySpeciesCreate = require('../internals/array-species-create');
9 var createProperty = require('../internals/create-property');
10 var arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');
12 var HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('splice');
14 var TypeError = global.TypeError;
17 var MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF;
18 var MAXIMUM_ALLOWED_LENGTH_EXCEEDED = 'Maximum allowed length exceeded';
20 // `Array.prototype.splice` method
21 // https://tc39.es/ecma262/#sec-array.prototype.splice
22 // with adding support of @@species
23 $({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {
24 splice: function splice(start, deleteCount /* , ...items */) {
25 var O = toObject(this);
26 var len = lengthOfArrayLike(O);
27 var actualStart = toAbsoluteIndex(start, len);
28 var argumentsLength = arguments.length;
29 var insertCount, actualDeleteCount, A, k, from, to;
30 if (argumentsLength === 0) {
31 insertCount = actualDeleteCount = 0;
32 } else if (argumentsLength === 1) {
34 actualDeleteCount = len - actualStart;
36 insertCount = argumentsLength - 2;
37 actualDeleteCount = min(max(toIntegerOrInfinity(deleteCount), 0), len - actualStart);
39 if (len + insertCount - actualDeleteCount > MAX_SAFE_INTEGER) {
40 throw TypeError(MAXIMUM_ALLOWED_LENGTH_EXCEEDED);
42 A = arraySpeciesCreate(O, actualDeleteCount);
43 for (k = 0; k < actualDeleteCount; k++) {
44 from = actualStart + k;
45 if (from in O) createProperty(A, k, O[from]);
47 A.length = actualDeleteCount;
48 if (insertCount < actualDeleteCount) {
49 for (k = actualStart; k < len - actualDeleteCount; k++) {
50 from = k + actualDeleteCount;
52 if (from in O) O[to] = O[from];
55 for (k = len; k > len - actualDeleteCount + insertCount; k--) delete O[k - 1];
56 } else if (insertCount > actualDeleteCount) {
57 for (k = len - actualDeleteCount; k > actualStart; k--) {
58 from = k + actualDeleteCount - 1;
59 to = k + insertCount - 1;
60 if (from in O) O[to] = O[from];
64 for (k = 0; k < insertCount; k++) {
65 O[k + actualStart] = arguments[k + 2];
67 O.length = len - actualDeleteCount + insertCount;