/*

     This file is part of Combean.

     Combean 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 2 of the License, or

     (at your option) any later version.

     Combean 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 Combean; if not, write to the Free Software

     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

 */

 /*

  * Created on 20.02.2005

  *

  */

 package net.sourceforge.combean.test.graph.containers;

 import java.util.EmptyStackException;

 import java.util.Stack;

 import junit.framework.TestCase;

 import net.sourceforge.combean.graph.NumberNode;

 import net.sourceforge.combean.graph.containers.StackAsNodeStack;

 import net.sourceforge.combean.interfaces.graph.Node;

 import net.sourceforge.combean.interfaces.graph.containers.NodeStack;

 /**

  * @author schickin

  *

  */

 public class TestStackAsNodeStack extends TestCase {

     private NodeStack S = null;

     private static final int STACKSIZE = 4;

     public static void main(String[] args) {

         junit.textui.TestRunner.run(TestStackAsNodeStack.class);

     }

     /*

      * @see TestCase#setUp()

      */

     protected void setUp() throws Exception {

         super.setUp();

         Stack<Node> genericStack = new Stack<Node>();

         this.S = new StackAsNodeStack(genericStack);

     }

     /*

      * @see TestCase#tearDown()

      */

     protected void tearDown() throws Exception {

         super.tearDown();

     }

     /**

      * Constructor for TestStackAsNodeStack.

      * @param name

      */

     public TestStackAsNodeStack(String name) {

         super(name);

     }

     public void testWorkWithStack() {

         for (int i = 0; i < STACKSIZE; i++) {

             this.S.push(new NumberNode(i));

         }

         assertFalse("stack is non-empty", this.S.isEmpty());

         for (int i = STACKSIZE-1; i >= 0; i--) {

             NumberNode v = (NumberNode) this.S.peek();

             assertEquals(i, v.getNodeNum());

             v = (NumberNode) this.S.pop();

             assertEquals(i, v.getNodeNum());

         }

         assertTrue("stack is empty after removing all elements",

                 this.S.isEmpty());

     }

     public void testEmptyStack() {

         assertTrue("initially the stack is empty", this.S.isEmpty());

         try {

             this.S.peek();

             fail("cannot peek on empty stack");

         }

         catch (EmptyStackException e) {

             /* expected exception has been thrown */

         }

         try {

             this.S.pop();

             fail("cannot peek on empty stack");

         }

         catch (EmptyStackException e) {

             /* expected exception has been thrown */

         }

     }

 }