Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2 : Set « Collections Data Structure « Java

Java 1.  2D Graphics GUI 2.  3D 3.  Advanced Graphics 4.  Ant 5.  Apache Common 6.  Chart 7.  Class 8.  Collections Data Structure 9.  Data Type 10.  Database SQL JDBC 11.  Design Pattern 12.  Development Class 13.  EJB3 14.  Email 15.  Event 16.  File Input Output 17.  Game 18.  Generics 19.  GWT 20.  Hibernate 21.  I18N 22.  J2EE 23.  J2ME 24.  JDK 6 25.  JNDI LDAP 26.  JPA 27.  JSP 28.  JSTL 29.  Language Basics 30.  Network Protocol 31.  PDF RTF 32.  Reflection 33.  Regular Expressions 34.  Scripting 35.  Security 36.  Servlets 37.  Spring 38.  Swing Components 39.  Swing JFC 40.  SWT JFace Eclipse 41.  Threads 42.  Tiny Application 43.  Velocity 44.  Web Services SOA 45.  XML Java Tutorial Java Source Code / Java Documentation Java Open Source Jar File Download Java Articles Java Products Java by API Photoshop Tutorials Maya Tutorials Flash Tutorials 3ds-Max Tutorials Illustrator Tutorials GIMP Tutorials C# / C Sharp C# / CSharp Tutorial C# / CSharp Open Source ASP.Net ASP.NET Tutorial JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C / ANSI-C C Tutorial C++ C++ Tutorial Ruby PHP Python Python Tutorial Python Open Source SQL Server / T-SQL SQL Server / T-SQL Tutorial Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial Flash / Flex / ActionScript VBA / Excel / Access / Word XML XML Tutorial Microsoft Office PowerPoint 2007 Tutorial Microsoft Office Excel 2007 Tutorial Microsoft Office Word 2007 Tutorial

Java » Collections Data Structure » Set Screenshots  Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2       import java.util.HashSet; import java.util.Set; public class Main {   public static void main(String[] argv) throws Exception {     Set set1 = new HashSet();     Set set2 = new HashSet();     set1.removeAll(set2);   } }                            Related examples in the same category 1.  Set, HashSet and TreeSet 2.  Things you can do with Sets 3.  Set operations: union, intersection, difference, symmetric difference, is subset, is superset 4.  Set implementation that use == instead of equals() 5.  Set that compares object by identity rather than equality 6.  Set union and intersection 7.  Set with values iterated in insertion order. 8.  Putting your own type in a Set 9.  Use set 10.  Another Set demo 11.  Set subtraction 12.  Working with HashSet and TreeSet 13.  TreeSet Demo 14.  Show the union and intersection of two sets 15.  Demonstrate the Set interface 16.  TreeSet Test 17.  Array Set extends AbstractSet 18.  Sync Test 19.  Set Copy 20.  Set and TreeSet 21.  Tail 22.  What you can do with a TreeSet 23.  Remove all elements from a set 24.  Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2 25.  Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2 26.  Extend AbstractSet to Create Simple Set 27.  Int Set 28.  One Item Set 29.  Small sets whose elements are known to be unique by construction 30.  List Set implements Set 31.  Converts a char array to a Set 32.  Converts a string to a Set 33.  Implements the Set interface, backed by a ConcurrentHashMap instance 34.  An IdentitySet that uses reference-equality instead of object-equality 35.  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. 36.  A thin wrapper around a List transforming it into a modifiable Set. 37.  A thread-safe Set that manages canonical objects