es6中set的属性、方法和使用

//set 数据结构 类似数组 成员信息唯一性
//添加1 add();
var s = new Set();
s.add('ggg').add(5555);
console.log(s); //Set { 'ggg', 5555 }

//添加2 数组
var s2 = new Set(['rrr',123,'rfggb']);
console.log(s2); //Set { 'rrr', 123, 'rfggb' }

//删除 delete() 返回值 true false 按名称来匹配
var s3 = new Set(['ffff','a','b','c',1,'2']);
console.log(s3.delete(1)); //true
console.log(s3); // Set { 'ffff', 'a', 'b', 'c', '2' }

//删除所有 clear() 没有返回值
var s4 = new Set(['ffff','a','b','c',1,'2']);
s4.clear(); //undefined
console.log(s4); // Set {}

//has()  匹配是否存在 返回true false  按名称来匹配
var s5 = new Set(['ffff','a','b','c',1,'2']);
console.log(s5.has(1)); //true

//属性 size 长度
var s6 = new Set(['ffff','a','b','c',1,'2']);
console.log(s6.size); //6

//数组去重
//1.es6
var arr = [1,1,2,2,3,4,55,66,44,55,87,25,25];
console.log([...new Set(arr)]); //[1, 2, 3, 4, 55, 66, 44, 87, 25]

//2.es5
var arr = [1,1,2,2,3,4,55,66,44,55,87,25,25];
function f (){
    var test = [];
    for(var i = 0 ;i<arr.length;i++){
        if(test.indexOf(arr[i]) == -1){
            test.push(arr[i])
        }
    }
    return test;
}
f(); //[1, 2, 3, 4, 55, 66, 44, 87, 25]
//2)
var arr = [1,1,2,2,3,4,55,66,44,55,87,25,25];
function f2 (){
    for(var i = 0;i<arr.length;i++){
        for(var j = i+1;j<arr.length;j++){
            if(arr[i] == arr[j]){
                arr.splice(j,1);
                j--;
            }
        }
    }
    return arr;
}
f2(); //[1, 2, 3, 4, 55, 66, 44, 87, 25]

//类型转换
//1. set --> 数组
var ss = new Set([1, 2, 3, 4, 55, 66, 44, 87, 25]);
console.log([...ss]);//[1, 2, 3, 4, 55, 66, 44, 87, 25]

//2.扩展
//求出大于100的数据且去重
//1)
var arr = [20,32,23,15,63,543,24,26,3,266,34,246,242,22,123,123,266,246,345,234,123];
console.log([...new Set(arr.filter(item => item > 100))]); //543, 266, 246, 242, 123, 345, 234]
//2)
var arr = [20,32,23,15,63,543,24,26,3,266,34,246,242,22,123,123,266,246,345,234,123];
console.log(Array.from(new Set(arr.filter(item => item > 100)))); //543, 266, 246, 242, 123, 345, 234]

//求二组数据的 并集  交集  差集
var arr1 =[2,3,5,2,5,7,3,5,36,4];
var arr2 = [8,9,4,1,2,3,7,3];
//1)并
console.log([...new Set([...arr1,...arr2])]); //[2, 3, 5, 7, 36, 4, 8, 9, 1]
//2)交
var arr1 =[2,3,5,2,5,7,3,5,36,4];
var arr2 = [8,9,4,1,2,3,7,3];
function f3(){
    a = Array.from(new Set(arr1));
    b = new Set(arr2);
    var c = []
    for(var i = 0 ;i<a.length;i++){
        if(b.has(a[i])){
            console.log(a[i])
            c.push(a[i])
        }
    }
    return c;
}
f3();//[2, 3, 7, 4]
//3)差
var arr1 =[2,3,5,2,5,7,3,5,36,4];
var arr2 = [8,9,4,1,2,3,7,3];
function f4(){
    a = Array.from(new Set(arr1));
    console.log(a); //[ 2, 3, 5, 7, 36, 4 ]
    b = Array.from(new Set(arr2));
    console.log(b); //[8, 9, 4, 1,2, 3, 7]
    for(var i = 0;i<a.length;i++){
        if(b.indexOf[a[i]] !==-1){
           a.splice(i,1)
        }
    }
    for(var i = 0;i<b.length;i++){
        if(a.indexOf[b[i]] !== -1){
           b.splice(i,1)
        }
    }
    // return b; //[9, 1, 3]
    // return a; //[3, 7, 4]
    return [...new Set([...a,...b])]; // [3, 7, 4, 9, 1]
    
}
f4();// [3, 7, 4, 9, 1]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值