added some minor formating things to test checkstyle reporting in cruisecontrol....

[tinyos-2.x.git] / apps / MultihopOscilloscope / java / Data.java

diff --git a/apps/MultihopOscilloscope/java/Data.java b/apps/MultihopOscilloscope/java/Data.java
index ac35aa72bb875b5a57a406aa4d8652dbf55381fc..7e6ff50aa9f6bd252b07c68be5736257a5fa10bd 100644 (file)
--- a/apps/MultihopOscilloscope/java/Data.java
+++ b/apps/MultihopOscilloscope/java/Data.java
@@ -18,57 +18,57 @@ class Data {
     private Oscilloscope parent;
 
     Data(Oscilloscope parent) {
-       this.parent = parent;
+    this.parent = parent;
     }
 
     /* Data received from mote nodeId containing NREADINGS samples from
        messageId * NREADINGS onwards. Tell parent if this is a new node. */
     void update(int nodeId, int messageId, int readings[]) {
-       if (nodeId >= nodes.length) {
-           int newLength = nodes.length * 2;
-           if (nodeId >= newLength)
-               newLength = nodeId + 1;
+    if (nodeId >= nodes.length) {
+        int newLength = nodes.length * 2;
+        if (nodeId >= newLength)
+        newLength = nodeId + 1;
 
-           Node newNodes[] = new Node[newLength];
-           System.arraycopy(nodes, 0, newNodes, 0, nodes.length);
-           nodes = newNodes;
-       }
-       Node node = nodes[nodeId];
-       if (node == null) {
-           nodes[nodeId] = node = new Node(nodeId);
-           parent.newNode(nodeId);
-       }
-       node.update(messageId, readings);
+        Node newNodes[] = new Node[newLength];
+        System.arraycopy(nodes, 0, newNodes, 0, nodes.length);
+        nodes = newNodes;
+    }
+    Node node = nodes[nodeId];
+    if (node == null) {
+        nodes[nodeId] = node = new Node(nodeId);
+        parent.newNode(nodeId);
+    }
+    node.update(messageId, readings);
     }
 
     /* Return value of sample x for mote nodeId, or -1 for missing data */
     int getData(int nodeId, int x) {
-       if (nodeId >= nodes.length || nodes[nodeId] == null)
-           return -1;
-       return nodes[nodeId].getData(x);
+    if (nodeId >= nodes.length || nodes[nodeId] == null)
+        return -1;
+    return nodes[nodeId].getData(x);
     }
 
     /* Return number of last known sample on mote nodeId. Returns 0 for
        unknown motes. */
     int maxX(int nodeId) {
-       if (nodeId >= nodes.length || nodes[nodeId] == null)
-           return 0;
-       return nodes[nodeId].maxX();
+    if (nodeId >= nodes.length || nodes[nodeId] == null)
+        return 0;
+    return nodes[nodeId].maxX();
     }
 
     /* Return number of largest known sample on all motes (0 if there are no
        motes) */
     int maxX() {
-       int max = 0;
+    int max = 0;
 
-       for (int i = 0; i < nodes.length; i++)
-           if (nodes[i] != null) {
-               int nmax = nodes[i].maxX();
+    for (int i = 0; i < nodes.length; i++)
+        if (nodes[i] != null) {
+        int nmax = nodes[i].maxX();
 
-               if (nmax > max)
-                   max = nmax;
-           }
+        if (nmax > max)
+            max = nmax;
+        }
 
-       return max;
+    return max;
     }
 }