This is an example of how to obtain a tail Set of TreeSet, using the tailSet(E fromElement) method . The method returns a view of the portion of this set whose elements are greater than or equal to fromElement. In order to use it you should:
- Create a new TreeSet.
- Populate the set with elements, with
add(E e)API method of TreeSet. - Invoke the
tailSet(E fromElement)method of TreeSet, to get a view of the portion of this set whose elements are greater than or equal to the element given as parameter to the method. The returned SortedSet is backed by this set, so changes in the returned set are reflected in this set, and vice-versa. The returned set supports all optional set operations that this set supports.
Let’s take a look at the code snippet that follows:
package com.javacodegeeks.snippets.core;
import java.util.TreeSet;
import java.util.SortedSet;
public class TailSetTreeSet {
public static void main(String[] args) {
// Create a TreeSet and populate it with elements
TreeSet treeSet = new TreeSet();
treeSet.add("element_1");
treeSet.add("element_3");
treeSet.add("element_2");
treeSet.add("element_4");
treeSet.add("element_5");
/*
SortedSet tailSet(Object fromElement) returns the portion of TreeSet whose elements are grater than fromElement.
The SortedSet returned is backed by the original TreeSet. So any changes made to SortedSet will
be reflected back to original TreeSet.
*/
SortedSet tailSet = treeSet.tailSet("element_3");
System.out.println("tailSet Contains : " + tailSet);
}
}
Output:
tailSet Contains : [element_3, element_4, element_5]
This was an example of how to obtain a tail Set of TreeSet in Java.
