Remove all elements from Java HashSet : HashSet « Collections Data Structure « Java






  1. Java
  2. Collections Data Structure
  3. HashSet

Remove all elements from Java HashSet

import java.util.HashSet; publicclass Main { publicstaticvoid main(String[] args) { HashSet<Integer> hSet = new HashSet<Integer>(); hSet.add(newInteger("1")); hSet.add(newInteger("2")); hSet.add(newInteger("3")); System.out.println(hSet); hSet.clear(); System.out.println(hSet); System.out.println(hSet.isEmpty()); } } /* [1, 2, 3] [] true */








Related examples in the same category

1.Add values to HashSet
2.HashSet implementation of setHashSet implementation of set
3.Generic collection conversion: HashSet and ArrayList
4.Remove one set from another set
5.Remove element from HashSet
6.Find maximum element of Java HashSet
7.Find Minimum element of Java HashSet
8.Get Enumeration over Java HashSet
9.Get Synchronized Set from Java HashSet
10.Check if a particular element exists in Java HashSet
11.Copy all elements of Java HashSet to an Object Array
12.Get Size of Java HashSet
13.Iterate through elements of Java HashSet
14.Integer value set
15.Listing the Elements of a Collection(iterate over the elements of set or list)
16.Remove specified element from Java HashSet
17.Convert array to Set
18.Implements a HashSet where the objects given are stored in weak references
19.Convert an ArrayList to HashSet
20.Create an array containing the elements in a set
21.Duplicate elements are discarded
22.Convert Set into array
23.A memory-efficient hash set.
24.Compact HashSet
25.Coarse-grained hash set.
26.Concurrent hash set that allows the lock array to be resized.
27.A CompactHashSet implements the set interface more tightly in memory and more efficiently than Java's java.util.HashSet.
28.Concurrent HashSet
close