SortedSet clear() method in Java with Examples

In order to eliminate every element from a SortedSet, we'll use the clear() method. The clear() method does not delete the set; it merely removes every entry from the set. To put it another way, the clear() method is only used to empty an existing Set. SortedSet is an extension of the Set interface, which includes this method. When clean() is called, it makes sure that the set's size is 0, so removing all of its contents. When you want to return the set to its initial state without generating a new instance, you usually use this method. The set will no longer have any elements after using clear(), but it will still have all of its characteristics (including sorting order in a TreeSet).

Syntax:

Parameters: No parameters are required by the method.

Return Value: There is no parameter required by the method.

Example 1:

The code provided shows how to use the clear() method in a TreeSet implementation of a SortedSet. The add() method is first used to populate the SortedSet with string entries. The TreeSet's sorting mechanism ensures that the elements are kept in their natural sequence. The set is then essentially restored to its initial state by calling the clear() method to delete every aspect from it. This illustrates how to fully empty a SortedSet while preserving its properties using the clear() method.

Implementation:

Output:

 The Initial Set is given by : [JavaTpoint, Welcome, World, the, to] The final set is given by : [] 

Example 2:

The code shows how to utilize the clear() method with a SortedSet that is implemented in Java using a TreeSet. The add() method is used to build an empty SortedSet of integers and then fill it with elements. Because this is a TreeSet's default behavior, the set's items are automatically sorted in ascending order. The set is then made empty by calling the clear() method, which eliminates all of its elements. To demonstrate the impact of the clear() method and demonstrate that it successfully eliminates all stored elements, the set's initial and final states are reported.

Implementation:

Output:

 The Initial Set is given by : [10, 20, 30, 40, 50] The final set is given by : []