Refactor di tutto lo stack. Manca l'esercizio sulle operazioni matematiche via stack. Sulla coda bisogna implementare da zero FixedArrayQueue e poi la relativa versione senza fullexception in ArrayQueue. Esercizi!

com/xgiovio/QueueTest.java

@@ -1,7 +1,7 @@
 package com.xgiovio;
 
 import general_utility.test_object;
-import queue.DynamicArrayQueue;
+import queue.ArrayQueueNoBlank;
 
 /**
  * Created with xgiovio.macbookair.
@@ -17,7 +17,7 @@ public class QueueTest {
 
 
 
-    DynamicArrayQueue<test_object> queue = new DynamicArrayQueue<test_object>(5);
+    ArrayQueueNoBlank<test_object> queue = new ArrayQueueNoBlank<test_object>(5);
 
         queue.enqueue(new test_object(1));
         System.out.println(queue.front().get_data());

com/xgiovio/StackCheckParenthesis.java

@@ -1,7 +1,7 @@
 package com.xgiovio;
 
-import exceptions.EmpyStackException;
-import stack.SinglePointerStack;
+import exceptions.EmptyStackException;
+import stack.NodeStack;
 
 import java.util.Scanner;
 
@@ -16,7 +16,7 @@ public class StackCheckParenthesis {
         String word = reader.nextLine();
         boolean status = true;
 
-        SinglePointerStack<Character> stack = new SinglePointerStack<Character>();
+        NodeStack<Character> stack = new NodeStack<Character>();
         try{
         for (int i = 0;i< word.length();i++){
 
@@ -72,7 +72,7 @@ public class StackCheckParenthesis {
             System.out.println("Stringa errata");
         }
         }
-        catch (EmpyStackException e){
+        catch (EmptyStackException e){
             System.out.println("Stringa errata");
         }
     }

com/xgiovio/StackInvertString.java

@@ -1,7 +1,6 @@
 package com.xgiovio;
 
-import exceptions.EmpyStackException;
-import stack.SinglePointerStack;
+import stack.NodeStack;
 
 import java.util.Scanner;
 
@@ -16,7 +15,7 @@ public class StackInvertString {
         String word = reader.nextLine();
         String word_inverted = "";
 
-        SinglePointerStack<Character> stack = new SinglePointerStack<Character>();
+        NodeStack<Character> stack = new NodeStack<Character>();
         for (int i = 0;i< word.length();i++){
              stack.push(word.charAt(i));
         }