Set operations: union, intersection, difference, symmetric difference, is subset, is superset

        

import java.util.Set;
import java.util.TreeSet;

public class Main {
  public static <T> Set<T> union(Set<T> setA, Set<T> setB) {
    Set<T> tmp = new TreeSet<T>(setA);
    tmp.addAll(setB);
    return tmp;
  }

  public static <T> Set<T> intersection(Set<T> setA, Set<T> setB) {
    Set<T> tmp = new TreeSet<T>();
    for (T x : setA)
      if (setB.contains(x))
        tmp.add(x);
    return tmp;
  }

  public static <T> Set<T> difference(Set<T> setA, Set<T> setB) {
    Set<T> tmp = new TreeSet<T>(setA);
    tmp.removeAll(setB);
    return tmp;
  }

  public static <T> Set<T> symDifference(Set<T> setA, Set<T> setB) {
    Set<T> tmpA;
    Set<T> tmpB;

    tmpA = union(setA, setB);
    tmpB = intersection(setA, setB);
    return difference(tmpA, tmpB);
  }

  public static <T> boolean isSubset(Set<T> setA, Set<T> setB) {
    return setB.containsAll(setA);
  }

  public static <T> boolean isSuperset(Set<T> setA, Set<T> setB) {
    return setA.containsAll(setB);
  }

  public static void main(String args[]) {
    TreeSet<Character> set1 = new TreeSet<Character>();
    TreeSet<Character> set2 = new TreeSet<Character>();

    set1.add('A');
    set1.add('B');
    set1.add('C');
    set1.add('D');

    set2.add('C');
    set2.add('D');
    set2.add('E');
    set2.add('F');

    System.out.println("set1: " + set1);
    System.out.println("set2: " + set2);

    System.out.println("Union: " + union(set1, set2));
    System.out.println("Intersection: " + intersection(set1, set2));
    System.out.println("Difference (set1 - set2): " + difference(set1, set2));
    System.out.println("Symmetric Difference: " + symDifference(set1, set2));

    TreeSet<Character> set3 = new TreeSet<Character>(set1);

    set3.remove('D');
    System.out.println("set3: " + set3);

    System.out.println("Is set1 a subset of set2? " + isSubset(set1, set3));
    System.out.println("Is set1 a superset of set2? " + isSuperset(set1, set3));
    System.out.println("Is set3 a subset of set1? " + isSubset(set3, set1));
    System.out.println("Is set3 a superset of set1? " + isSuperset(set3, set1));

  }
}

Related examples in the same category

1.	Set, HashSet and TreeSet
2.	Things you can do with Sets
3.	Set implementation that use == instead of equals()
4.	Set that compares object by identity rather than equality
5.	Set union and intersection
6.	Set with values iterated in insertion order.
7.	Putting your own type in a Set
8.	Use set
9.	Another Set demo
10.	Set subtraction
11.	Working with HashSet and TreeSet
12.	TreeSet Demo
13.	Show the union and intersection of two sets
14.	Demonstrate the Set interface
15.	Array Set extends AbstractSet
16.	Sync Test
17.	Set Copy
18.	Set and TreeSet
19.	Tail
20.	What you can do with a TreeSet
21.	Remove all elements from a set
22.	Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2
23.	Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2
24.	Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2
25.	Extend AbstractSet to Create Simple Set
26.	Int Set
27.	One Item Set
28.	Small sets whose elements are known to be unique by construction
29.	List Set implements Set
30.	Converts a char array to a Set
31.	Converts a string to a Set
32.	Implements the Set interface, backed by a ConcurrentHashMap instance
33.	An IdentitySet that uses reference-equality instead of object-equality
34.	An implementation of the java.util.Stack based on an ArrayList instead of a Vector, so it is not synchronized to protect against multi-threaded access.
35.	A thin wrapper around a List transforming it into a modifiable Set.
36.	A thread-safe Set that manages canonical objects
37.	This program uses a set to print all unique words in System.in
38.	Indexed Set
39.	An ObjectToSet provides a java.util.Map from arbitrary objects to objects of class java.util.Set.
40.	Sorted Multi Set
41.	Fixed Size Sorted Set
42.	Set operations
43.	A NumberedSet is a generic container of Objects where each element is identified by an integer id.
44.	Set which counts the number of times a values are added to it.
45.	Set which counts the number of times a values are added to it and assigns them a unique positive index.
46.	Indexed Set
47.	A set acts like array.
48.	Implements a Bloom filter. Which, as you may not know, is a space-efficient structure for storing a set.
49.	Implementation of disjoint-set data structure
50.	Call it an unordered list or a multiset, this collection is defined by oxymorons

Set operations: union, intersection, difference, symmetric difference, is subset, is superset : Set « Collections Data Structure « Java

Related examples in the same category