Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/java/sortedset-headset-method-in-java/ below:

SortedSet headSet() method in Java

Last Updated : 11 Jul, 2025

The headSet() method of

is used to return a view of the portion of this set whose elements are strictly less than the parameter

.

• The set returned by this method is backed by this set, so changes in the returned set are reflected in this set, and vice-versa.
• The set returned by this method supports all optional set operations that this set supports.

: The set returned by this method will throw an

if an attempt is made to insert an element outside its range.

:

SortedSet headSet(E toElement)

Where, E is the type of element maintained by this Set.

: This function accepts a single parameter

which represent the high endpoint (exclusive) of the returned set.

: It returns the last or the highest element currently in the set.

:

• ClassCastException : It throws a ClassCastException if toElement is not compatible with this set's comparator (or, if the set has no comparator, if toElement does not implement Comparable).
• NullPointerException : It throws a NullPointerException if the parameter toElement is null.
• IllegalArgumentException : It throws an IllegalArgumentException this set itself has a restricted range, and the parameter toElement lies outside the bounds of the range.

Below programs illustrate the above method:

:

// A Java program to demonstrate
// working of SortedSet
import java.util.SortedSet;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args)
    {
        // Create a TreeSet and inserting elements
        SortedSet<Integer> s = new TreeSet<>();

        // Adding Element to SortedSet
        s.add(1);
        s.add(5);
        s.add(2);
        s.add(3);
        s.add(9);

        // Returning the set with elements
        // strictly less than the passed value
        System.out.print("Elements strictly less than 7 in set are : "
                         + s.headSet(7));
    }
}

Elements strictly less than 7 in set are : [1, 2, 3, 5]

:

// A Java program to demonstrate
// working of SortedSet
import java.util.SortedSet;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args)
    {
        // Create a TreeSet and inserting elements
        SortedSet<String> s = new TreeSet<>();

        // Adding Element to SortedSet
        s.add("Geeks");
        s.add("For");
        s.add("Geeks");
        s.add("Code");
        s.add("It");

        // Returning the set with elements
        // strictly less than the passed value
        System.out.print("Element strictly less than Z in set is : "
                         + s.headSet("Z"));
    }
}

Element strictly less than Z in set is : [Code, For, Geeks, It]

:

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4