JAVA EE: Java : Collection Framework : TreeSet (tailSet)

Monday, 5 January 2015

Java : Collection Framework : TreeSet (tailSet)

Click here to watch in Youtube :
https://www.youtube.com/watch?v=RsGs2XNoFEc&list=UUhwKlOVR041tngjerWxVccw

TreeSetExample.java

import java.util.SortedSet;
import java.util.TreeSet;

/*
 * Example of tailSet(E fromElement) method.
 */
public class TreeSetExample
{
    public static void main( String[] args )
    {

        TreeSet<Integer> treeSet = new TreeSet<Integer>();

        treeSet.add(40);
        treeSet.add(20);
        treeSet.add(30);
        treeSet.add(10);
        treeSet.add(50);

        System.out.println("treeSet : " + treeSet + "\n");

        /*
         * Returns a view of the portion of this set whose elements are greater
         * than or equal to fromElement. 
         * 
         * The returned set 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. 
         * 
         * Equivalent to tailSet(fromElement, true).
         */

        SortedSet<Integer> sortedSet = treeSet.tailSet(20);
        System.out.println("sortedSet : " + sortedSet + "\n");

        System.out.println("--------------------------------------------\n");

        sortedSet.remove(30);

        System.out.println("After removing element '30' in SortedSet \n");
        System.out.println("sortedSet : " + sortedSet);
        System.out.println("treeSet : " + treeSet + "\n");

    }
}

Output

treeSet : [10, 20, 30, 40, 50]

sortedSet : [20, 30, 40, 50]

--------------------------------------------

After removing element '30' in SortedSet 

sortedSet : [20, 40, 50]
treeSet : [10, 20, 40, 50]