Java Collections Framework- HashSet Class
A HashSet is a collection set that neither allows duplicate elements nor order or position its elements.
This class implements the Set interface and extends AbstractSet. It creates a collection that uses a hash table for storage. Hash table stores information by using a mechanism called hashing. In hashing, the informational content of a key is used to determine a unique value, called its hash code. The hash code is then used as an index at which the data associated with the key is stored. The transformation of key into its hash code is performed automatically.HashSet is not synchronized. It makes no guarantees as to the iteration order of the set; in particular, it does not guarantee that the order will remain constant over time. This class permits the null element.
The HashSet class supports four constructors. The first form constructs a default hash set:
HashSet( )
HashSet(Collection c)
HashSet(int capacity)
HashSet(int capacity, float fillRatio)
Here is an example that demonstrates a HashSet:- HashSetDemo.java
package devmanuals.com; import java.util.*; public class HashSetDemo { public static void main(String args[]) { HashSet HSet = new HashSet(); HSet.add("C"); HSet.add("A"); HSet.add("B"); HSet.add("E"); HSet.add("F"); HSet.add("D"); System.out.println("The HashSet elements are: " + HSet); } }
Output:
The HashSet elements are: [D, E, F, A, B, C] |