数组方法重写：forEach, map, filter

Array.prototype.myForEach = function(fn) {
        var arr = this,
          len = arr.length,
          arg2 = arguments[1] || window;
        for(var i = 0; i < len; i++) {
          fn.apply(arg2, [arr[i], i, arr]);
        }
      };

      Array.prototype.myFilter = function(fn) {
        var arr = this,
          len = arr.length,
          arg2 = arguments[1] || window,
          newArr = [];
        for(var i =0; i < len; i++) {
          var item = deepClone(arr[i]);
          fn.apply(arg2, [item, i, arr])? newArr.push(item): ‘‘
        }

        return newArr;
      }

      Array.prototype.myMap = function(fn) {
        var arr = this,
          len = arr.length,
          arg2 = arguments[1] || window,
          newArr = [];
        for(var i =0; i < len; i++) {
          var item = deepClone(arr[i]);
          newArr.push(fn.apply(arg2, [item, i, arr]));
        }
        return newArr;
      }

      function deepClone(source, target) {
        var target = target || {};
        for(var key in source) {
          if(typeof(source[key]) === ‘object‘ && source[key] !== null) {
            if(Object.prototype.toString.call(source[key]) === ‘[object Object]‘) {
              target[key] = {};
            } else if(Object.prototype.toString.call(source[key]) === ‘[object Array]‘) {
              target[key] = [];
            }
            deepClone(source[key], target[key]);
          } else {
            target[key] = source[key]
          }
        }
        return target;
      }

      var arr = [{id: 1}, {id: 2}];
      arr.myForEach(function(item, index, myArr){
        item.id = item.id +1;
      });

      var arrFilter = arr.myFilter(function(item, index, myArr) {
        return item.id > 2;
      });

      var arrMap = arr.myFilter(function(item, index, myArr) {
        return item.id = item.id + 2;
      });

原文地址：https://www.cnblogs.com/ycherry/p/12106123.html