Getting the difference between two sets

by

Try this 

test2.removeAll(test1);

Set#removeAll

Removes from this set all of its elements that are contained in the specified collection (optional operation). If the specified collection is also a set, this operation effectively modifies this set so that its value is the asymmetric set difference of the two sets.

More Related Contents:

  1. Removing duplicates from arraylist using set
  2. Cartesian product of an arbitrary number of sets
  3. Obtaining a powerset of a set in Java
  4. What is the difference between Set and List?
  5. How to convert an Array to a Set in Java
  6. Java Set retain order?
  7. Picking a random element from a set
  8. How to calculate the intersection of two sets? [duplicate]
  9. Getting an element from a Set
  10. Different types of thread-safe Sets in Java
  11. What is the best way get the symmetric difference between two sets in java?
  12. Efficiently compute Intersection of two Sets in Java?
  13. Iteratively compute the Cartesian product of an arbitrary number of sets
  14. Get unique values from ArrayList in Java
  15. Difference between Iterator and Listiterator?
  16. Why doesn’t java.util.Set have get(int index)?
  17. Removing items from a collection in java while iterating over it
  18. Any implementation of Ordered Set in Java?
  19. Changing HashMap keys during iteration
  20. Efficiently finding the intersection of a variable number of sets of strings
  21. Classical set operations for java.util.Collection
  22. Why does TreeSet throw a ClassCastException?
  23. HashSet contains duplicate entries
  24. How to set background image in Java?
  25. Cartesian product of streams in Java 8 as stream (using streams only)
  26. Why does my TreeSet not add anything beyond the first element?
  27. Issue with below snippet on boundary matchers regex (\b)
  28. How to Iterate over a Set/HashSet without an Iterator?
  29. Java HashSet with a custom equality criteria? [duplicate]
  30. Convert Set to HashMap

Leave a Comment