TreeSet subSet

In this chapter you will learn:

  1. Get the head set and tail set from a TreeSet
  2. How to get a range of value from a TreeSet

Get the head set and tail set

Since the elements in TreeSet are sorted we can get a subset before or after a certain value.

The following methods can return a subset with values less than passed in or with values greater than the passed in value.

  • SortedSet<E> headSet(E toElement) Returns a view of the portion of this set whose elements are less than toElement.
  • NavigableSet<E> headSet(E toElement, boolean inclusive) Returns a view of the portion of this set whose elements are less than (or equal to, if inclusive is true) toElement.
  • SortedSet<E> tailSet(E fromElement) Returns a view of the portion of this set whose elements are greater than or equal to fromElement.
  • NavigableSet<E> tailSet(E fromElement, boolean inclusive) returns a view of the portion of this set whose elements are greater than (or equal to, if inclusive is true) fromElement.
import java.util.Arrays;
import java.util.TreeSet;
// java2s. c o  m
public class Main {
  public static void main(String args[]) throws Exception {

    String elements[] = { "java2s.com", "C", "D", "G", "F" };
    TreeSet<String> set = new TreeSet<String>(Arrays.asList(elements));

    System.out.println(set.headSet("D"));
    System.out.println(set.tailSet("D"));
  }
}

The output:

Subset in a range

Other than the head set and tail set we can also get a subset within a range of values.

  • NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
    Returns a view of the portion of this set whose elements range from fromElement to toElement.
  • SortedSet<E> subSet(E fromElement, E toElement)
    Returns a view of the portion of this set whose elements range from fromElement, inclusive, to toElement, exclusive.
import java.util.Arrays;
import java.util.TreeSet;
//from  ja  va 2s .  c  om
public class Main {
  public static void main(String args[]) throws Exception {

    String elements[] = { "java2s.cm", "C", "D", "G", "F" };
    TreeSet<String> set = new TreeSet<String>(Arrays.asList(elements));

    System.out.println(set.subSet("C", "F"));
  }
}

The output:

Next chapter...

What you will learn in the next chapter:

  1. What is NavigableSet and how to use NavigableSet
Home » Java Tutorial » Collections

List interface
List add/insert elements
List clear/remove elements
List search
List element get and set
List and its Iterator
List size, empty
List conversion, to array
List to sublist
List comparison
ArrayList
ArrayList Creation
ArrayList add/insert
ArrayList get/set element
ArrayList clear/remove
ArrayList search
ArrayList copy and shallow copy
ArrayList size, trim to size and capacity
ArrayList to array
LinkedList class
LinkedList creation
LinkedList add/insert elements
LinkedList get elements
LinkedList search
LinkeList replace/set elements
LinkedList remove element
LinkedList copy
LinkedList iterator
LinkedList peek element
LinkedList pop/push element
LinkedList conversion
Map interface
Map element adding
Map.Entry class
Map key
Map value
Map key/value search
Map delete/remove
Map comparison
HashMap Class
HashMap search
HashMap clone
TreeMap
TreeMap key
TreeMap head sub map
TreeMap tail sub map
TreeMap sub map
NavigableMap
NavigableMap key
NavigableMap key-value pair
LinkedHashMap Class
IdentityHashMap
SortedMap
HashSet
HashSet element adding
HashSet element removing and clearing
HashSet clone
HashSet iterator
HashSet properties
TreeSet
TreeSet elements adding
TreeSet subSet
NavigableSet
LinkedHashSet
Iterator
ListIterator
List filling
List reversing
List rotating and shuffling
List sorting
List element swap
List element replacing
List copy
List binary search
Collection unmodifiable
Collection synchronized
Collection singleton
Collection max/min value
Empty Collections
Comparator
Comparable
Enumeration
EnumSet
EnumMap Class
PriorityQueue