1) changes on the definitely written analysis: it only takes care about locations...

[IRC.git] / Robust / src / ClassLibrary / Queue.java

diff --git a/Robust/src/ClassLibrary/Queue.java b/Robust/src/ClassLibrary/Queue.java
index c5a7a3cb3e7f75a499fecc41ae35ad9799cff748..45cbb0be8ebb927aa3bc2f0cbe65d5e4c076273a 100644 (file)
--- a/Robust/src/ClassLibrary/Queue.java
+++ b/Robust/src/ClassLibrary/Queue.java
@@ -115,24 +115,24 @@ public class Queue {
       Object[] newElements = new Object[newCapacity];
 
       if (newElements == null) {
-       return false;
+        return false;
       }
 
       int dst = 0;
       Object[] tmpelements = elements;
       if (pop < push) {
-       int src;
-       for (src = (pop + 1); src < push; src++, dst++) {
-         newElements[dst] = elements[src];
-       }
+        int src;
+        for (src = (pop + 1); src < push; src++, dst++) {
+          newElements[dst] = elements[src];
+        }
       } else {
-       int src;
-       for (src = (pop + 1); src < capacity; src++, dst++) {
-         newElements[dst] = elements[src];
-       }
-       for (src = 0; src < push; src++, dst++) {
-         newElements[dst] = elements[src];
-       }
+        int src;
+        for (src = (pop + 1); src < capacity; src++, dst++) {
+          newElements[dst] = elements[src];
+        }
+        for (src = 0; src < push; src++, dst++) {
+          newElements[dst] = elements[src];
+        }
       }
 
       //elements = null;