Mega Code Archive
Pop an empty stack ntry times and catch the resulting exception
<![CDATA[
/*
This program is a part of the companion code for Core Java 8th ed.
(http://horstmann.com/corejava)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import java.util.Date;
import java.util.EmptyStackException;
import java.util.Stack;
/**
* @version 1.10 2000-06-03
* @author Cay Horstmann
*/
public class ExceptionalTest
{
public static void main(String[] args)
{
int i = 0;
int ntry = 10000000;
Stack<String> s = new Stack<String>();
long s1;
long s2;
// test a stack for emptiness ntry times
System.out.println("Testing for empty stack");
s1 = new Date().getTime();
for (i = 0; i <= ntry; i++)
if (!s.empty()) s.pop();
s2 = new Date().getTime();
System.out.println((s2 - s1) + " milliseconds");
// pop an empty stack ntry times and catch the resulting exception
System.out.println("Catching EmptyStackException");
s1 = new Date().getTime();
for (i = 0; i <= ntry; i++)
{
try
{
s.pop();
}
catch (EmptyStackException e)
{
}
}
s2 = new Date().getTime();
System.out.println((s2 - s1) + " milliseconds");
}
}
]]>