filter 方法
對(duì)數(shù)組每一項(xiàng)運(yùn)行給定函數(shù),返回?cái)?shù)組中函數(shù)運(yùn)行返回 true 時(shí)的結(jié)果
- 示例
let arr = [1, 2, 3, 4, 5];
let fitered = arr.filter(item => item > 3);
console.log(fitered); // [4, 5]
- 實(shí)現(xiàn)
Array.prototype.filter = function (fn) {
let newArr = [];
for (let i = 0, len = this.length; i < len; i++) {
fn(this[i]) && newArr.push(this[i]);
}
return newArr;
}
console.log(arr.filter(item => item > 3)) // [4, 5]
map 方法
對(duì)數(shù)組中的每一項(xiàng)運(yùn)行給定的函數(shù),返回每次函數(shù)調(diào)用結(jié)果組成的數(shù)組
- 示例
let arr = [1, 2, 3, 4, 5];
let maped = arr.map(item => item*2);
console.log(maped) // [2, 4, 6, 8, 10]
- 實(shí)現(xiàn)
Array.prototype.map = function (fn) {
let newArr = [];
for (let i = 0, len = this.length; i < len; i++) {
newArr.push(fn(this[i]));
}
return newArr;
}
console.log(arr.map(item => item + 1)); // [2, 3, 4, 5, 6]
forEach 方法
無(wú)返回值
- 實(shí)現(xiàn)
Array.prototype.forEach = function (fn) {
for (let i = 0, len = this.length; i < len; i++) {
fn(this[i]);
}
}
some 方法
對(duì)數(shù)組的每一項(xiàng)運(yùn)行給定函數(shù),只要有一項(xiàng)使得函數(shù)返回 true 則方法返回 true ,后續(xù)元素不再檢測(cè)
- 實(shí)現(xiàn)
Array.prototype.some = function (fn) {
for (let i = 0, len = this.length; i < len; i++) {
if (fn(this[i])) {
return true;
}
}
return false;
}
every 方法
對(duì)數(shù)組每一項(xiàng)運(yùn)行給定函數(shù),只有每一項(xiàng)都使得函數(shù)返回 true 則方法返回 true
- 實(shí)現(xiàn)
Array.prototype.every = function (fn) {
for (let i = 0, len = this.length; i < len; i++) {
if (!fn(this[i])) {
return false;
}
}
return true;
}
歸并方法 reduce
迭代數(shù)組所有項(xiàng),對(duì)每一項(xiàng)運(yùn)行給定函數(shù),該函數(shù)接收四個(gè)參數(shù)(前一個(gè)值,當(dāng)前值,項(xiàng)的索引,數(shù)組對(duì)象),函數(shù)返回的值將作為第一個(gè)參數(shù)傳給下一項(xiàng)
- 示例
let arr = [1, 2, 3, 4, 5];
let sum = arr.reduce(function(pre, cur, index, arr) {
return pre + cur;
});
console.log(sum); // 15
- 實(shí)現(xiàn)
Array.prototype.reduce = function (reducer, initVal = this[0] || 0) {
for (let i = 1, len = this.length; i < len; i++) {
initVal = reducer(initVal, this[i], i, this);
}
return initVal;
}