Array.prototype.indexOf = function (searchElement /*, fromIndex */ ) {//不要经常用indexOf,因为indexof效率会更低的,但是为什么有的代码要写这个
'use strict';
if (this == null) {
throw new TypeError();
}
var n, k, t = Object(this),
len = t.length >>> 0;
if (len === 0) {//你说给了空数组,那肯定给出-1
return -1;
}
n = 0;
if (arguments.length > 1) {
n = Number(arguments[1]);
if (n != n) { // shortcut for verifying if it's NaN----------------这个本身都不相等时,肯定是NaN
n = 0;
} else if (n != 0 && n != Infinity && n != -Infinity) {
n = (n > 0 || -1) * Math.floor(Math.abs(n));
}
}
if (n >= len) {
return -1;
}
console.log(typeof t);
for (k = n >= 0 ? n : Math.max(len - Math.abs(n), 0); k < len; k++) {-----------------------当然如果给出了一个负数,就要从len-Math.abs(n)
if (k in t && t[k] === searchElement) {
return k;
}
}
return -1;
};
'use strict';
if (this == null) {
throw new TypeError();
}
var n, k, t = Object(this),
len = t.length >>> 0;
if (len === 0) {//你说给了空数组,那肯定给出-1
return -1;
}
n = 0;
if (arguments.length > 1) {
n = Number(arguments[1]);
if (n != n) { // shortcut for verifying if it's NaN----------------这个本身都不相等时,肯定是NaN
n = 0;
} else if (n != 0 && n != Infinity && n != -Infinity) {
n = (n > 0 || -1) * Math.floor(Math.abs(n));
}
}
if (n >= len) {
return -1;
}
console.log(typeof t);
for (k = n >= 0 ? n : Math.max(len - Math.abs(n), 0); k < len; k++) {-----------------------当然如果给出了一个负数,就要从len-Math.abs(n)
if (k in t && t[k] === searchElement) {
return k;
}
}
return -1;
};