js 两个数组的交集

//两个数组的交集就是相同属性的取出来
    this.intersection = function () {
        var arg = getArg(arguments);
        var o = arg["Array"][0] || [];
        var o1 = arg["Array"][1] || [];
        var judge = arg["function"][0] || arg["string"][0] || function () { return false; };
        var param = arg["Object"][0] || {};
        if (o.constructor == Array && o1.constructor == Array) {
            judge = judge || {};
            if (judge.constructor == String) {
                judge = judge.replace(/\*0./g, 'a.');
                judge = judge.replace(/\*1./g, 'b.');
                judge = judge.replace(/@/g, 'param.');
                judge = judge.replace(/param.param./g, '@');
                var IST = [];
                for (var i = 0, a, iLen = o.length; a = o[i++];) {
                    for (var j = 0, b, jLen = o1.length; b = o1[j++];) {
                        if (eval(judge)) {
                            IST.push(a);
                            break;
                        }
                    }
                }
                return IST;
            } else if (judge.constructor == Function) {
                var IST = [];
                for (var i = 0, a, iLen = o.length; a = o[i++];) {
                    for (var j = 0, b, jLen = o1.length; b = o1[j++];) {
                        if (judge(a, b)) {
                            IST.push(a);
                            break;
                        }
                    }
                }
                return IST;
            } else if (judge.constructor == Object) {
                var IST = [];
                for (var i = 0, a, iLen = o.length; a = o[i++];) {
                    for (var j = 0, b, jLen = o1.length; b = o1[j++];) {
                        if (isEqualForSimple(a, b)) {
                            IST.push(a);
                            break;
                        }
                    }
                }
                return IST;
            }
        }

    }
//获取参数
    var getArg = function (arg) {
        var ret = {
            'number': [],
            'string': [],
            'boolean': [],
            'object': [],
            'Object': [],
            'Array': [],
            'function': [],
            'Date': [],
            'null': []
        }
        for (var i = 0, len = arg.length; i < len; i++) {
            var ar = arg[i];
            if (typeof (ar) == 'number') {
                ret['number'].push(ar);
            } else if (typeof (ar) == 'string') {
                ret['string'].push(ar);
            } else if (typeof (ar) == 'boolean') {
                ret['boolean'].push(ar);
            } else if (typeof (ar) == 'function') {
                ret['function'].push(ar);
            } else if (typeof (ar) == 'object') {
                if (ar) {
                    if (ar.constructor == Object) {
                        ret['object'].push(ar);
                        ret['Object'].push(ar);
                    } else if (ar.constructor == Array) {
                        ret['object'].push(ar);
                        ret['Array'].push(ar);
                    } else if (ar.constructor == Date) {
                        ret['Date'].push(ar);
                    }
                } else {
                    ret['null'].push(ar);
                }
            }
        }
        return ret;
    }

想用更多的方法请打开JavaScript基础包

转载于:https://my.oschina.net/u/3875237/blog/3021062

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值