js数组判断是否包含某个元素(includes)和set集合抽取不同的值Sets.difference

1.js数组

// var hiddenArray= new Array(3);
var hiddenArray= ['a','s','d','f'];
heddenArray.includes("a"); //true

2.set集合

Set<String> ekpIds = Sets.newHashSet(relationMap.keySet()); 
Set<String> dingIds = Sets.newHashSet(allDingIds);  //将集合转为Set
SetView<String> diff_ekpIds = Sets.difference(ekpIds, dingIds); //返回ekpIds中不在dingIds的元素 

其他例子：

  HashSet<String> set1 = Sets.newHashSet("A", "B", "C");  
    set1.add("D");  
    set1.add("E");  
    set1.add("F");  
    System.out.println(set1);  
      
    //LinkedHashSet  
    LinkedHashSet<String> set2 = Sets.newLinkedHashSet();  
    set2.add("D");  
    set2.add("E");  
    set2.add("F");  
    set2.add("G");  
    set2.add("H");  
    System.out.println(set2);  
      
    SetView<String> setView1 = Sets.union(set1, set2); //并集  
    System.out.println(setView1); //[A, B, C, D, E, F, G, H]  
      
    SetView<String> setView2 = Sets.intersection(set1, set2); //交集  
    System.out.println(setView2); //[D, E, F]  
      
    SetView<String> setView3 = Sets.difference(set1, set2); //返回set1中不在set2的元素  
    System.out.println(setView3); //[A, B, C]