Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2 : Set « Collections « Java Tutorial

1.	Language
2.	Data Type
3.	Operators
4.	Statement Control
5.	Class Definition
6.	Development
7.	Reflection
8.	Regular Expressions
9.	Collections
10.	Thread
11.	File
12.	Generics
13.	I18N
14.	Swing
15.	Swing Event
16.	2D Graphics
17.	SWT
18.	SWT 2D Graphics
19.	Network
20.	Database
21.	Hibernate
22.	JPA
23.	JSP
24.	JSTL
25.	Servlet
26.	Web Services SOA
27.	EJB3
28.	Spring
29.	PDF
30.	Email
31.	J2ME
32.	J2EE Application
33.	XML
34.	Design Pattern
35.	Log
36.	Security
37.	Apache Common
38.	Ant
39.	JUnit

Java Source Code / Java Documentation

Java Open Source

Jar File Download

Photoshop Tutorials

Flash Tutorials

3ds-Max Tutorials

Illustrator Tutorials

C# / CSharp Tutorial

C# / CSharp Open Source

ASP.NET Tutorial

JavaScript DHTML

JavaScript Tutorial

JavaScript Reference

HTML CSS Reference

Python Tutorial

Python Open Source

SQL Server / T-SQL

SQL Server / T-SQL Tutorial

Oracle PL / SQL

Oracle PL/SQL Tutorial

VB.Net Tutorial

Flash / Flex / ActionScript

VBA / Excel / Access / Word

Microsoft Office PowerPoint 2007 Tutorial

Microsoft Office Excel 2007 Tutorial

Microsoft Office Word 2007 Tutorial

Java Tutorial » Collections » Set

9. 18. 13. Get the intersection of set1 and set2, set1 becomes the intersection 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.retainAll(set2);



    // Remove all elements from a set

    set1.clear();



  }

}

9. 18. Set
	9. 18. 1.	Convert a List to a Set
	9. 18. 2.	Convert an ArrayList to HashSet
	9. 18. 3.	Creating a Sorted Set
	9. 18. 4.	Create new sets from Iterable, var argv
	9. 18. 5.	Create an array containing the elements in a set
	9. 18. 6.	Comparable with a sorted collection.
	9. 18. 7.	Duplicate elements are discarded
	9. 18. 8.	Creating a Set That Retains Order-of-Insertion
	9. 18. 9.	Convert Set into array
	9. 18. 10.	Convert Set into List
	9. 18. 11.	Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2
	9. 18. 12.	Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2
	9. 18. 13.	Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2
	9. 18. 14.	Set operations: union, intersection, difference, symmetric difference, is subset, is superset
	9. 18. 15.	Remove all elements from a set
	9. 18. 16.	List Set
	9. 18. 17.	Set implementation that use == instead of equals()
	9. 18. 18.	Set union and intersection
	9. 18. 19.	Set with values iterated in insertion order.
	9. 18. 20.	Implements the Set interface, backed by a ConcurrentHashMap instance
	9. 18. 21.	A weak HashSet: element stored in the WeakHashSet might be garbage collected
	9. 18. 22.	An IdentitySet that uses reference-equality instead of object-equality
	9. 18. 23.	A thin wrapper around a List transforming it into a modifiable Set.
	9. 18. 24.	Concurrent set
	9. 18. 25.	Set that compares object by identity rather than equality

www.java2java.com | Contact Us

Copyright 2009 - 12 Demo Source and Support. All rights reserved.

All other trademarks are property of their respective owners.