Example of TreeSet in Collection Framework
import java.util.*;
class TestTreeSet
{
public static void main(String args[])
{
TreeSet set = new TreeSet();
set.add("JAVA");
set.add("J2EE");
System.out.print("Result of adding J2ME fro first lin : "+set.add("J2ME"));
set.add("Spring');
set.add("Android");
System.out.println("Size of the set is "+set.size());
System.out.print("Result of adding J2ME for second time : "+set.add("J2ME"));
Iterator itr = set.iterator();
while(itr.hasNext())
{
System.out.println(itr.next());
}
}
}
br />
Example of HasSet in Collection Framework
import java.util.*;
class TestHashSet
{
public static void main(String args[])
{
HashSet set = new HashSet();
set.add("JAVA");
set.add("J2EE");
System.out.print("Result of adding J2ME fro first lin : "+set.add("J2ME"));
set.add("Spring');
set.add("Android");
System.out.println("Size of the set is "+set.size());
System.out.print("Result of adding J2ME for second time : "+set.add("J2ME"));
Iterator itr = set.iterator();
while(itr.hasNext())
{
System.out.println(itr.next());
}
}
import java.util.*;
class TestTreeSet
{
public static void main(String args[])
{
TreeSet set = new TreeSet();
set.add("JAVA");
set.add("J2EE");
System.out.print("Result of adding J2ME fro first lin : "+set.add("J2ME"));
set.add("Spring');
set.add("Android");
System.out.println("Size of the set is "+set.size());
System.out.print("Result of adding J2ME for second time : "+set.add("J2ME"));
Iterator itr = set.iterator();
while(itr.hasNext())
{
System.out.println(itr.next());
}
}
}
br />
Example of HasSet in Collection Framework
import java.util.*;
class TestHashSet
{
public static void main(String args[])
{
HashSet set = new HashSet();
set.add("JAVA");
set.add("J2EE");
System.out.print("Result of adding J2ME fro first lin : "+set.add("J2ME"));
set.add("Spring');
set.add("Android");
System.out.println("Size of the set is "+set.size());
System.out.print("Result of adding J2ME for second time : "+set.add("J2ME"));
Iterator itr = set.iterator();
while(itr.hasNext())
{
System.out.println(itr.next());
}
}
0 Comments:
Post a Comment