Updated quadtree tests to check the nodes property of the node (a d…

…3_geom_quadtreeNode) instead of treating the node as an array (which it is not) and trying to check indexes within it. e.g. `node[2]`.
rjain11 · Mar 22, 2014 · a2fae34 · a2fae34
1 parent e4d5da3
commit a2fae34
Showing 1 changed file with 12 additions and 12 deletions.
diff --git a/test/geom/quadtree-test.js b/test/geom/quadtree-test.js
@@ -29,10 +29,10 @@ suite.addBatch({
             n = 0;
         q.visit(function(node, x1, y1, x2, y2) {
           assert.deepEqual(node.point, point);
-          assert.isUndefined(node[0]);
-          assert.isUndefined(node[1]);
-          assert.isUndefined(node[2]);
-          assert.isUndefined(node[3]);
+          assert.isUndefined(node.nodes[0]);
+          assert.isUndefined(node.nodes[1]);
+          assert.isUndefined(node.nodes[2]);
+          assert.isUndefined(node.nodes[3]);
           assert.isTrue(node.leaf);
           ++n;
         });
@@ -46,10 +46,10 @@ suite.addBatch({
             n = 0;
         q.visit(function(node, x1, y1, x2, y2) {
           assert.deepEqual(node.point, point);
-          assert.isUndefined(node[0]);
-          assert.isUndefined(node[1]);
-          assert.isUndefined(node[2]);
-          assert.isUndefined(node[3]);
+          assert.isUndefined(node.nodes[0]);
+          assert.isUndefined(node.nodes[1]);
+          assert.isUndefined(node.nodes[2]);
+          assert.isUndefined(node.nodes[3]);
           assert.isTrue(node.leaf);
           ++n;
         });
@@ -60,10 +60,10 @@ suite.addBatch({
             n = 0;
         q.visit(function(node, x1, y1, x2, y2) {
           assert.isNull(node.point);
-          assert.isUndefined(node[0]);
-          assert.isUndefined(node[1]);
-          assert.isUndefined(node[2]);
-          assert.isUndefined(node[3]);
+          assert.isUndefined(node.nodes[0]);
+          assert.isUndefined(node.nodes[1]);
+          assert.isUndefined(node.nodes[2]);
+          assert.isUndefined(node.nodes[3]);
           assert.isTrue(node.leaf);
           ++n;
         });