package javatemplate1; import java.util.HashSet; import java.util.Set; import java.util.SortedSet; import java.util.TreeSet; public class JavaTemplate1 { // example of public static void main(String[] args) { // TODO code application logic here System.out.println("main block executing "); // Create a set :: set CAN'T HAVE DUPLICATE // TREESET CAN HAVE DUPLICATE TreeSet ts1 = new TreeSet<>(); // = new HashSet<>(); ts1.add("A");ts1.add("B");ts1.add("C"); ts1.add("D");ts1.add("E"); //TreeSet subset1 = s1.subSet("BLACK", "GRAY"); SortedSet subset1 = ts1.subSet("B", "C"); subset1 = ts1.subSet("B",true, "C", true); //ts1. // Create another set Set s2 = new HashSet<>(); s2.add("C");s2.add("F");s2.add("G");s2.add("H"); //Print the elements of both sets System.out.println("ts1: " + ts1); System.out.println("subset1: " + subset1); System.out.println("s2: " + s2); // Perform set operations performUnion( subset1, s2); performIntersection(subset1,s2); performDifference(subset1, s2); testForSubset(subset1, s2); testForSubset(ts1, subset1); } public static void performUnion(Set s1, Set s2) { Set s1Unions2 = new HashSet<>(s1); s1Unions2.addAll(s2); System.out.println("subset1 union s2: " + s1Unions2); } public static void performIntersection(Set s1, Set s2) { Set s1Intersections2 = new HashSet<>(s1); s1Intersections2.retainAll(s2); System.out.println("subset1 intersection s2: " + s1Intersections2); } public static void performDifference(Set s1, Set s2) { Set s2Differences1 = new HashSet<>(s2); Set s1Differences2 = new HashSet<>(s1); s1Differences2.removeAll(s2); s2Differences1.removeAll(s1); System.out.println("subset1 difference s2: " + s1Differences2); System.out.println("s2 difference subset1: " + s2Differences1); } public static void testForSubset(Set s1, Set s2) { System.out.println("s2 is subset subset1: " + s1.containsAll(s2)); System.out.println("subset1 is subset s2: " + s2.containsAll(s1)); } }