SortedSet contains() method in Java with Examples

The contains() method is used to check whether a specific element is present in the SortedSet or not. So basically it is used to check if a SortedSet contains any particular element.


boolean contains(Object element)

Parameters: The parameter element is of the type of SortedSet. This is the element that needs to be tested if it is present in the set or not.

Return Value: The method returns true if the element is present in the set else return False.

Note: The addAll() method in SortedSet is inherited from the Set interface in Java.

Below program illustrate the Java.util.Set.contains() method:





// Java code to illustrate
// SortedSet.contains() method
import java.util.*;
public class SortedSetDemo {
    public static void main(String args[])
        // Creating an empty Set
        SortedSet<String> set
            = new TreeSet<String>();
        // Using add() method to
        // add elements into the Set
        // Displaying the Set
        System.out.println("Set: " + set);
        // Check for "Geeks" in the set
            "Does the Set contains 'Geeks'? "
            + set.contains("Geeks"));
        // Check for "4" in the set
            "Does the Set contains '4'? "
            + set.contains("4"));
        // Check if the Set contains "No"
            "Does the Set contains 'No'? "
            + set.contains("No"));



Set: [4, Geeks, To, Welcome]
Does the Set contains 'Geeks'? true
Does the Set contains '4'? true
Does the Set contains 'No'? false


Attention reader! Don’t stop learning now. Get hold of all the important Java and Collections concepts with the Fundamentals of Java and Java Collections Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.