import java.util.*;

public class S
{
	public static void main(String args[])
	{
		Stack<Integer> s = new Stack<Integer>();

		//push
		for(int i = 0; i < 10; i++)
			System.out.printf("%4d", s.push(i));
		System.out.println();

		//toString
		System.out.println(s);

		//search
		System.out.printf("Search: %d%n", s.search(5));

		//peek
		System.out.printf("Peer: %d%n", s.peek());

		//empty and pop
		while(!s.empty())
		{
			System.out.printf("%4d", s.pop());
		}
		System.out.println();
	}
}
			

• For Vector and Stack

import java.util.*;

public class S
{
	public static void main(String args[])
	{
		Stack<Integer> s = new Stack<Integer>();

		//push
		for(int i = 0; i < 10; i++)
			System.out.printf("%4d", s.push(i));
		System.out.println();

		Enumeration e = s.elements();

		while(e.hasMoreElements())
		{
			System.out.printf("%4d", e.nextElement());
		}
		System.out.println();
	}
}
			

• hasNext, next, remove
• Only forward direction iterating
• Not able to replace or add element

import java.util.*;

public class S
{
	public static void main(String args[])
	{
		Stack<Integer> s = new Stack<Integer>();

		//push
		for(int i = 0; i < 10; i++)
			System.out.printf("%4d", s.push(i));
		System.out.println();

		Iterator itr = s.iterator();

		while(itr.hasNext())
		{
			System.out.printf("%4d", itr.next());
		}
		System.out.println();
		
		//remove
		itr = s.iterator();
		while(itr.hasNext())
		{
			if((Integer)itr.next()%2 == 0)
				itr.remove();
		}

		System.out.println(s);
	}
}
			

• Iterator and for-each have same performance
• They are much faster than for loop for collection with no random access

import java.util.*;

public class S
{
	public static void main(String args[])
	{
		Stack<Integer> s = new Stack<Integer>();

		for(int i = 0; i < 10; i++)
			s.add(i);

		System.out.println(s);

		for(int e : s)
			System.out.printf("%4d", e);
		System.out.println();
	}
}
			

• Stack at GeekForGeek
• Iterator at GeekForGeek
• Iterator and for-each