LQI version of MultihopOscilloscope.

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

diff --git a/apps/MultihopOscilloscopeLqi/java/Data.java b/apps/MultihopOscilloscopeLqi/java/Data.java
new file mode 100644 (file)
index 0000000..ac35aa7
--- /dev/null
+++ b/apps/MultihopOscilloscopeLqi/java/Data.java
@@ -0,0 +1,74 @@
+/*
+ * Copyright (c) 2006 Intel Corporation
+ * All rights reserved.
+ *
+ * This file is distributed under the terms in the attached INTEL-LICENSE     
+ * file. If you do not find these files, copies can be found by writing to
+ * Intel Research Berkeley, 2150 Shattuck Avenue, Suite 1300, Berkeley, CA, 
+ * 94704.  Attention:  Intel License Inquiry.
+ */
+
+import java.util.*;
+
+/* Hold all data received from motes */
+class Data {
+    /* The mote data is stored in a flat array indexed by a mote's identifier.
+       A null value indicates no mote with that identifier. */
+    private Node[] nodes = new Node[256];
+    private Oscilloscope parent;
+
+    Data(Oscilloscope 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;
+
+           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);
+    }
+
+    /* 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();
+    }
+
+    /* Return number of largest known sample on all motes (0 if there are no
+       motes) */
+    int maxX() {
+       int max = 0;
+
+       for (int i = 0; i < nodes.length; i++)
+           if (nodes[i] != null) {
+               int nmax = nodes[i].maxX();
+
+               if (nmax > max)
+                   max = nmax;
+           }
+
+       return max;
+    }
+}