Add more tests for closest.

Chris Hallberg · Chris Hallberg · commit 75e7b2e93728 · 2019-03-04T16:33:04.000-05:00
diff --git a/test/quadtree.spec.js b/test/quadtree.spec.js
@@ -318,15 +318,26 @@ describe('QuadTree', () => {
       ];
       points.forEach(point => quadtree.insert(point));
     });
+    it('requires a point to query', () => {
+      expect(() => { quadtree.closest() }).to.throw("Method 'closest' needs a point");
+    });
     it('returns empty array when quadtree is empty', () => {
       quadtree = new QuadTree(new Rectangle(0, 0, 100, 100), 4);
       found = quadtree.closest(new Point(0, 0), 1);
       expect(found).to.have.length(0);
     });
+    it('returns all items when number requested exceeds QuadTree contents', () => {
+      found = quadtree.closest(new Point(0, 0), 10);
+      expect(found).to.have.length(4);
+    });
     it('returns closest item', () => {
       found = quadtree.closest(new Point(0, 0), 1);
       expect(found).to.contain(points[0]);
     });
+    it('returns default number of items (one)', () => {
+      found = quadtree.closest(new Point(0, 0));
+      expect(found).to.have.length(1);
+    });
     it('returns correct number of items (one)', () => {
       found = quadtree.closest(new Point(0, 0), 1);
       expect(found).to.have.length(1);
@@ -344,10 +355,6 @@ describe('QuadTree', () => {
       expect(found).to.have.length(1);
       expect(found).to.contain(points[0]);
     });
-    it('returns all items when number requested exceeds QuadTree contents', () => {
-      found = quadtree.closest(new Point(0, 0), 10);
-      expect(found).to.have.length(4);
-    });
   });
   describe('size', () => {
     let quadtree;
