无序集合,add的顺序不是存储顺序 1.add(K key, V value) 2.difference(K key, otherK[s]) :差集,返回Set 3.differenceAndStore(K key, otherKey[s], K destKey) :存储差集,返回Long 4.intersect(K key, otherKey[s]):交集,返回Set 5.intersectAndStore(K key, otherKey[s], K destKey) :存储交集,返回Lon…