diff graal/com.oracle.max.graal.graph/src/com/oracle/max/graal/graph/NodeArray.java @ 2994:7ed943d4d730

Fix checkstyle issues.
author Thomas Wuerthinger <thomas@wuerthinger.net>
date Thu, 16 Jun 2011 13:44:57 +0200
parents c7ce8d00c33f
children 53dcb0794619
line wrap: on
line diff
--- a/graal/com.oracle.max.graal.graph/src/com/oracle/max/graal/graph/NodeArray.java	Wed Jun 15 21:20:44 2011 +0200
+++ b/graal/com.oracle.max.graal.graph/src/com/oracle/max/graal/graph/NodeArray.java	Thu Jun 16 13:44:57 2011 +0200
@@ -53,7 +53,7 @@
         nodes[index] = node;
         return result;
     }
-    
+
     public AbstractList<Node> variablePart() {
         return new AbstractList<Node>() {
 
@@ -77,24 +77,24 @@
                 variableLength++;
                 checkIndex(index);
                 NodeArray.this.ensureSize();
-                for (int i=size() - 1; i > index; i--) {
-                    NodeArray.this.nodes[fixedLength + i] = NodeArray.this.nodes[fixedLength + i-1];
+                for (int i = size() - 1; i > index; i--) {
+                    NodeArray.this.nodes[fixedLength + i] = NodeArray.this.nodes[fixedLength + i - 1];
                 }
                 set(index, element);
             }
-            
+
             private void checkIndex(int index) {
                 if (index < 0 || index >= size()) {
                     throw new IndexOutOfBoundsException();
                 }
             }
-            
+
             @Override
             public Node remove(int index) {
                 checkIndex(index);
                 Node n = get(index);
                 set(index, Node.Null);
-                for (int i=index; i < size() - 1; i++) {
+                for (int i = index; i < size() - 1; i++) {
                     NodeArray.this.nodes[fixedLength + i] = NodeArray.this.nodes[fixedLength + i + 1];
                 }
                 NodeArray.this.nodes[fixedLength + size() - 1] = Node.Null;
@@ -107,19 +107,19 @@
 
     private void ensureSize() {
         if (size() > nodes.length) {
-            nodes = Arrays.copyOf(nodes, (nodes.length + 1)*2);
+            nodes = Arrays.copyOf(nodes, (nodes.length + 1) * 2);
         }
     }
-    
+
     public void setOrExpand(int index, Node node) {
         if (index < 0) {
             throw new IndexOutOfBoundsException();
         }
-        
+
         while (index >= size()) {
             variablePart().add(Node.Null);
         }
-        
+
         set(index, node);
     }
 
@@ -129,7 +129,7 @@
         assert node == Node.Null || node.graph == self().graph : "node is from different graph: (this=" + self() + ") and (node=" + node + ")";
         assert node == Node.Null || node.id() != Node.DeletedID : "inserted node must not be deleted";
         assert node != self() || node.getClass().toString().contains("Phi") : "No direct circles allowed in the graph! " + node;
-        
+
         Node old = get(index);
         if (old != node) {
             silentSet(index, node);
@@ -166,7 +166,7 @@
             set(i, other.get(i));
         }
     }
-    
+
     private void checkIndex(int index) {
         if (index < 0 || index >= size()) {
             throw new IndexOutOfBoundsException();