stripchart 0.0.3

data/lib/stripchart/public/components/d3/test/geom/quadtree-test.js

@@ -0,0 +1,139 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.geom.quadtree");
+
+suite.addBatch({
+  "quadtree": {
+    topic: load("geom/quadtree").expression("d3.geom.quadtree"),
+    "the default quadtree layout": {
+      topic: function(quadtree) {
+        return quadtree();
+      },
+      "has no defined size": function(q) {
+        assert.isNull(q.size());
+      },
+      "has no defined extent": function(q) {
+        assert.isNull(q.extent());
+      },
+      "has the default x-accessor, d[0]": function(q) {
+        assert.strictEqual(q.x()([42, 43]), 42);
+      },
+      "has the default y-accessor, d[1]": function(q) {
+        assert.strictEqual(q.y()([42, 43]), 43);
+      },
+      "can create a single-node quadtree with no bounds": function(q) {
+        var point = [0, 0],
+            q = q([point]),
+            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.isTrue(node.leaf);
+          ++n;
+        });
+        assert.strictEqual(n, 1, "number of visits");
+      }
+    },
+    "the quadtree applied directly": {
+      "can create a single-node quadtree with no bounds": function(quadtree) {
+        var point = {x: 0, y: 0},
+            q = quadtree([point]),
+            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.isTrue(node.leaf);
+          ++n;
+        });
+        assert.strictEqual(n, 1, "number of visits");
+      },
+      "can create an empty quadtree": function(quadtree) {
+        var q = quadtree([], 8, 10, 56, 47),
+            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.isTrue(node.leaf);
+          ++n;
+        });
+        assert.strictEqual(n, 1, "number of visits");
+      },
+      "squarifies the input dimensions": function(quadtree) {
+        var ox1 = 8,
+            oy1 = 10,
+            ox2 = 56,
+            oy2 = 47,
+            q = quadtree([], ox1, oy1, ox2, oy2),
+            n = 0;
+        q.visit(function(node, x1, y1, x2, y2) {
+          assert.strictEqual(x1, ox1);
+          assert.strictEqual(y1, oy1);
+          assert.strictEqual(x2, Math.max(ox2 - ox1, oy2 - oy1) + x1);
+          assert.strictEqual(y2, Math.max(ox2 - ox1, oy2 - oy1) + y1);
+          ++n;
+        });
+        assert.strictEqual(n, 1, "number of visits");
+      },
+      "with three arguments, x1 and y1 are 0,0": function(quadtree) {
+        var dx = 56,
+            dy = 47,
+            q = quadtree([], dx, dy),
+            n = 0;
+        q.visit(function(node, x1, y1, x2, y2) {
+          assert.strictEqual(x1, 0);
+          assert.strictEqual(y1, 0);
+          assert.strictEqual(x2, Math.max(dx, dy));
+          assert.strictEqual(y2, Math.max(dx, dy));
+          ++n;
+        });
+        assert.strictEqual(n, 1, "number of visits");
+      },
+      "visit": {
+        "uses pre-order traversal": function(quadtree) {
+          var a = {x: 100, y: 100},
+              b = {x: 200, y: 200},
+              c = {x: 300, y: 300},
+              q = quadtree([a, b, c], 960, 500),
+              expected = [
+                {point: null, x1:   0, y1:   0, x2: 960, y2: 960},
+                {point: null, x1:   0, y1:   0, x2: 480, y2: 480},
+                {point: null, x1:   0, y1:   0, x2: 240, y2: 240},
+                {point:    a, x1:   0, y1:   0, x2: 120, y2: 120},
+                {point:    b, x1: 120, y1: 120, x2: 240, y2: 240},
+                {point:    c, x1: 240, y1: 240, x2: 480, y2: 480}
+              ];
+          q.visit(function(node, x1, y1, x2, y2) {
+            assert.deepEqual({point: node.point, x1: x1, y1: y1, x2: x2, y2: y2}, expected.shift());
+            assert.equal(!!node.point, node.leaf);
+          });
+          assert.isEmpty(expected);
+        },
+        "does not recurse if the callback returns truthy": function(quadtree) {
+          var a = {x: 100, y: 100},
+              b = {x: 700, y: 700},
+              c = {x: 800, y: 800},
+              q = quadtree([a, b, c], 960, 500),
+              n = 0;
+          q.visit(function(node, x1, y1, x2, y2) {
+            ++n;
+            return x1 > 0;
+          });
+          assert.equal(n, 3);
+        }
+      }
+    }
+  }
+});
+
+suite.export(module);

data/lib/stripchart/public/components/d3/test/geom/voronoi-test.js

@@ -0,0 +1,230 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.geom.voronoi");
+
+suite.addBatch({
+  "voronoi": {
+    topic: load("geom/voronoi").expression("d3.geom.voronoi"),
+
+    "the default voronoi layout": {
+      topic: function(voronoi) {
+        return voronoi();
+      },
+      "has no defined clip extent": function(v) {
+        assert.isNull(v.clipExtent());
+      },
+      "has no defined size": function(v) {
+        assert.isNull(v.size());
+      },
+      "returns the configured clip extent": function(v) {
+        try {
+          assert.deepEqual(v.clipExtent([[1, 2], [3, 4]]).clipExtent(), [[1, 2], [3, 4]]);
+        } finally {
+          v.clipExtent(null);
+        }
+      },
+      "returns the configured size": function(v) {
+        try {
+          assert.deepEqual(v.size([1, 2]).size(), [1, 2]);
+        } finally {
+          v.size(null);
+        }
+      },
+      "size implies a clip extent from [0, 0]": function(v) {
+        try {
+          assert.deepEqual(v.size([1, 2]).clipExtent(), [[0, 0], [1, 2]]);
+        } finally {
+          v.size(null);
+        }
+      },
+      "clip extent implies a size, assuming [0, 0]": function(v) {
+        try {
+          assert.deepEqual(v.clipExtent([[1, 2], [3, 4]]).size(), [3, 4]);
+        } finally {
+          v.clipExtent(null);
+        }
+      },
+      "has the default x-accessor, d[0]": function(v) {
+        assert.strictEqual(v.x()([42, 43]), 42);
+      },
+      "has the default y-accessor, d[1]": function(v) {
+        assert.strictEqual(v.y()([42, 43]), 43);
+      },
+      "of two points": {
+        topic: function(v) {
+          return v([[200, 200], [760, 300]]);
+        },
+        "returns two cells with the expected geometry": function(cells) {
+          assert.inDelta(cells, [
+            [[-178046.7857142857, 1e6], [179096.07142857145, -1e6], [-1e6, 1e6], [1e6, 1e6]],
+            [[-178046.7857142857, 1e6], [179096.07142857145, -1e6], [-1e6, -1e6], [1e6, -1e6]]
+          ], 1e-6);
+        },
+        "the returned cells are open polygons": function(cells) {
+          cells.forEach(function(cell) {
+            assert.greater(cell.length, 2);
+            cell.forEach(function(point) {
+              assert.equal(point.length, 2);
+              assert.isNumber(point[0]);
+              assert.isNumber(point[1]);
+            });
+            assert.notDeepEqual(cell[0], cell[cell.length - 1]);
+          });
+        },
+        "the returned cells are not clipped to the layout size": function(cells) {
+          var x0 = Infinity, x1 = -Infinity, y0 = Infinity, y1 = -Infinity;
+          cells.forEach(function(cell) {
+            cell.forEach(function(point) {
+              if (point[0] < x0) x0 = point[0];
+              if (point[0] > x1) x1 = point[0];
+              if (point[1] < y0) y0 = point[1];
+              if (point[1] > y1) y1 = point[1];
+            });
+          });
+          assert.strictEqual(x0, -1e6);
+          assert.strictEqual(x1, 1e6);
+          assert.strictEqual(y0, -1e6);
+          assert.strictEqual(y1, 1e6);
+        },
+        "the returned cells' point property points back to the input point": function(cells) {
+          assert.deepEqual(cells.map(function(cell) { return cell.point; }), [[200, 200], [760, 300]]);
+        }
+      },
+      "links": {
+        "for two points": function(v) {
+          assert.deepEqual(v.links([[200, 200], [760, 300]]), [
+            {source: [200, 200], target: [760, 300]}
+          ]);
+        },
+        "for three points": function(v) {
+          assert.deepEqual(v.links([[200, 200], [500, 250], [760, 300]]), [
+            {source: [200, 200], target: [760, 300]},
+            {source: [500, 250], target: [760, 300]},
+            {source: [200, 200], target: [500, 250]}
+          ]);
+        }
+      },
+      "triangles": {
+        "for three points": function(v) {
+          assert.deepEqual(asArray(v.triangles([[200, 200], [500, 250], [760, 300]])), [
+            [[200, 200], [760, 300], [500, 250]]
+          ]);
+        }
+      }
+    },
+
+    "a voronoi layout with custom x- and y-accessors": {
+      topic: function(voronoi) {
+        return voronoi()
+            .x(function(d) { return d.x; })
+            .y(43);
+      },
+      "observes the specified x-accessor, a function": function(v) {
+        assert.strictEqual(v.x()({x: 42, y: 43}), 42);
+      },
+      "observes the specified y-accessor, a constant": function(v) {
+        assert.strictEqual(v.y(), 43);
+      },
+      "of two points": {
+        topic: function(v) {
+          return v([{x: 200}, {x: 760}]);
+        },
+        "returns two cells with the expected geometry": function(cells) {
+          assert.inDelta(cells, [
+            [[480, 1e6], [480, -1e6], [-1e6, -1e6], [-1e6, 1e6]],
+            [[480, -1e6], [480, 1e6], [1e6, -1e6], [1e6, 1e6]]
+          ], 1e-6);
+        }
+      },
+      "links": {
+        topic: function(v) {
+          return v.y(function(d) { return d.y; });
+        },
+        "for two points": function(v) {
+          assert.deepEqual(v.links([{x: 200, y: 200}, {x: 760, y: 300}]), [
+            {source: {x: 200, y: 200}, target: {x: 760, y: 300}}
+          ]);
+        },
+        "for three points": function(v) {
+          assert.deepEqual(v.links([{x: 200, y: 200}, {x: 500, y: 250}, {x: 760, y: 300}]), [
+            {source: {x: 200, y: 200}, target: {x: 760, y: 300}},
+            {source: {x: 500, y: 250}, target: {x: 760, y: 300}},
+            {source: {x: 200, y: 200}, target: {x: 500, y: 250}}
+          ]);
+        }
+      }
+    },
+
+    "a voronoi layout with clip extent [[0, 0], [960, 500]]": {
+      topic: function(voronoi) {
+        return voronoi()
+            .x(function(d) { return d.x; })
+            .y(function(d) { return d.y; })
+            .clipExtent([[0, 0], [960, 500]]);
+      },
+      "of two points": {
+        topic: function(v) {
+          return v([{x: 200, y: 200}, {x: 760, y: 300}]);
+        },
+        "returns two cells with the expected geometry": function(cells) {
+          assert.inDelta(cells, [
+            [[435.35714285715324, 500], [524.6428571428696, 0], [0, 0], [0, 500]],
+            [[960, 0], [960, 500], [435.35714285715324, 500], [524.6428571428696, 0]]
+          ], 1e-6);
+        },
+        "the returned cells are clipped to the layout size": function(cells) {
+          assert.isTrue(cells.every(function(cell) {
+            return cell.every(function(point) {
+              return point[0] >= 0 && point[0] <= 960
+                  && point[1] >= 0 && point[1] <= 500;
+            });
+          }));
+        }
+      }
+    },
+
+    "the default voronoi layout applied directly": {
+      "with zero points": {
+        "returns the empty array": function(voronoi) {
+          assert.deepEqual(voronoi([]), []);
+        }
+      },
+      "with one point": {
+        "returns the semi-infinite bounding box": function(voronoi) {
+          assert.deepEqual(asArray(voronoi([[50, 50]], 100, 100)), [[[-1000000,-1000000],[-1000000,1000000],[1000000,1000000],[1000000,-1000000]]]);
+        }
+      },
+      "with two points": {
+        "separated by a line at 90° (vertical)": function(voronoi) {
+          assert.deepEqual(asArray(voronoi([[50, 25], [50, 75]], 100, 100)), [[[-1000000,50],[1000000,50],[-1000000,-1000000],[1000000,-1000000]],[[-1000000,50],[1000000,50],[-1000000,1000000],[1000000,1000000]]]);
+          assert.deepEqual(asArray(voronoi([[50, 75], [50, 25]], 100, 100)), [[[-1000000,50],[1000000,50],[-1000000,1000000],[1000000,1000000]],[[-1000000,50],[1000000,50],[-1000000,-1000000],[1000000,-1000000]]]);
+        },
+        "separated by a line at 0° (horizontal)": function(voronoi) {
+          assert.deepEqual(asArray(voronoi([[25, 50], [75, 50]], 100, 100)), [[[50,1000000],[50,-1000000],[-1000000,-1000000],[-1000000,1000000]],[[50,-1000000],[50,1000000],[1000000,-1000000],[1000000,1000000]]]);
+          assert.deepEqual(asArray(voronoi([[75, 50], [25, 50]], 100, 100)), [[[50,-1000000],[50,1000000],[1000000,-1000000],[1000000,1000000]],[[50,1000000],[50,-1000000],[-1000000,-1000000],[-1000000,1000000]]]);
+        },
+        "separated by a line at 45° (diagonal)": function(voronoi) {
+          assert.deepEqual(asArray(voronoi([[25, 25], [75, 75]], 100, 100)), [[[-999900,1000000],[1000100,-1000000],[-1000000,-1000000]],[[-999900,1000000],[1000100,-1000000],[1000000,1000000]]]);
+          assert.deepEqual(asArray(voronoi([[75, 25], [25, 75]], 100, 100)), [[[-1000000,-1000000],[1000000,1000000],[1000000,-1000000]],[[-1000000,-1000000],[1000000,1000000],[-1000000,1000000]]]);
+        },
+        "separated by an arbitrary diagonal": function(voronoi) {
+          assert.deepEqual(asArray(voronoi([[25, 25], [50, 75]], 100, 100)), [[[-1000000,500068.75],[1000000,-499931.25],[-1000000,-1000000],[1000000,-1000000]],[[-1000000,500068.75],[1000000,-499931.25],[-1000000,1000000],[1000000,1000000]]]);
+          assert.deepEqual(asArray(voronoi([[25, 25], [75, 50]], 100, 100)), [[[-499931.25,1000000],[500068.75,-1000000],[-1000000,1000000],[1000000,1000000]], [[-499931.25,1000000],[500068.75,-1000000],[-1000000,-1000000],[1000000,-1000000]]]);
+        }
+      },
+      "with three points": {
+        "collinear": function(voronoi) {
+          assert.deepEqual(asArray(voronoi([[25, 25], [50, 50], [75, 75]], 100, 100)), [[[-999925,1000000],[1000075,-1000000],[-1000000,-1000000]],[[-999925,1000000],[-999875,1000000],[1000125,-1000000],[1000075,-1000000]],[[-999875,1000000],[1000125,-1000000],[1000000,1000000]]]);
+        }
+      }
+    }
+  }
+});
+
+suite.export(module);
+
+function asArray(array) {
+  return Array.isArray(array) ? array.map(asArray) : array;
+}

data/lib/stripchart/public/components/d3/test/interpolate/array-test.js

@@ -0,0 +1,24 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.interpolateArray");
+
+suite.addBatch({
+  "interpolateArray": {
+    topic: load("interpolate/array").expression("d3.interpolateArray"),
+    "interpolates defined elements": function(interpolate) {
+      assert.deepEqual(interpolate([2, 12], [4, 24])(.5), [3, 18]);
+    },
+    "interpolates nested objects and arrays": function(interpolate) {
+      assert.deepEqual(interpolate([[2, 12]], [[4, 24]])(.5), [[3, 18]]);
+      assert.deepEqual(interpolate([{foo: [2, 12]}], [{foo: [4, 24]}])(.5), [{foo: [3, 18]}]);
+    },
+    "merges non-shared elements": function(interpolate) {
+      assert.deepEqual(interpolate([2, 12], [4, 24, 12])(.5), [3, 18, 12]);
+      assert.deepEqual(interpolate([2, 12, 12], [4, 24])(.5), [3, 18, 12]);
+    }
+  }
+});
+
+suite.export(module);

data/lib/stripchart/public/components/d3/test/interpolate/ease-test.js

@@ -0,0 +1,135 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.ease");
+
+suite.addBatch({
+  "ease": {
+    topic: load("interpolate/ease").expression("d3.ease"),
+    "supports linear easing": function(ease) {
+      var e = ease("linear");
+      assert.inDelta(e(.5), .5, 1e-6);
+    },
+    "supports polynomial easing": function(ease) {
+      var e = ease("poly", 2);
+      assert.inDelta(e(.5), .25, 1e-6);
+    },
+    "supports quadratic easing": function(ease) {
+      var e = ease("quad");
+      assert.inDelta(e(.5), .25, 1e-6);
+    },
+    "supports cubic easing": function(ease) {
+      var e = ease("cubic");
+      assert.inDelta(e(.5), .125, 1e-6);
+    },
+    "supports sinusoidal easing": function(ease) {
+      var e = ease("sin");
+      assert.inDelta(e(.5), 1 - Math.cos(Math.PI / 4), 1e-6);
+    },
+    "supports exponential easing": function(ease) {
+      var e = ease("exp");
+      assert.inDelta(e(.5), 0.03125, 1e-6);
+    },
+    "supports circular easing": function(ease) {
+      var e = ease("circle");
+      assert.inDelta(e(.5), 0.133975, 1e-6);
+    },
+    "supports elastic easing": function(ease) {
+      var e = ease("elastic");
+      assert.inDelta(e(.5), 0.976061, 1e-6);
+    },
+    "supports back easing": function(ease) {
+      var e = ease("back");
+      assert.inDelta(e(.5), -0.0876975, 1e-6);
+    },
+    "supports bounce easing": function(ease) {
+      var e = ease("bounce");
+      assert.inDelta(e(.5), 0.765625, 1e-6);
+    },
+    "invalid eases and modes default to linear-in": function(ease) {
+      var e = ease("__proto__-__proto__");
+      assert.strictEqual(e(0), 0);
+      assert.strictEqual(e(.5), .5);
+      assert.strictEqual(e(1), 1);
+      var e = ease("hasOwnProperty-constructor");
+      assert.strictEqual(e(0), 0);
+      assert.strictEqual(e(.5), .5);
+      assert.strictEqual(e(1), 1);
+    },
+    "all easing functions return exactly 0 for t = 0": function(ease) {
+      assert.strictEqual(ease("linear")(0), 0);
+      assert.strictEqual(ease("poly", 2)(0), 0);
+      assert.strictEqual(ease("quad")(0), 0);
+      assert.strictEqual(ease("cubic")(0), 0);
+      assert.strictEqual(ease("sin")(0), 0);
+      assert.strictEqual(ease("exp")(0), 0);
+      assert.strictEqual(ease("circle")(0), 0);
+      assert.strictEqual(ease("elastic")(0), 0);
+      assert.strictEqual(ease("back")(0), 0);
+      assert.strictEqual(ease("bounce")(0), 0);
+    },
+    "all easing functions return exactly 1 for t = 1": function(ease) {
+      assert.strictEqual(ease("linear")(1), 1);
+      assert.strictEqual(ease("poly", 2)(1), 1);
+      assert.strictEqual(ease("quad")(1), 1);
+      assert.strictEqual(ease("cubic")(1), 1);
+      assert.strictEqual(ease("sin")(1), 1);
+      assert.strictEqual(ease("exp")(1), 1);
+      assert.strictEqual(ease("circle")(1), 1);
+      assert.strictEqual(ease("elastic")(1), 1);
+      assert.strictEqual(ease("back")(1), 1);
+      assert.strictEqual(ease("bounce")(1), 1);
+    },
+    "the -in suffix returns the identity": function(ease) {
+      assert.inDelta(ease("linear-in")(.25), ease("linear")(.25), 1e-6);
+      assert.inDelta(ease("quad-in")(.75), ease("quad")(.75), 1e-6);
+    },
+    "the -out suffix returns the reverse": function(ease) {
+      assert.inDelta(ease("sin-out")(.25), 1 - ease("sin-in")(.75), 1e-6);
+      assert.inDelta(ease("bounce-out")(.25), 1 - ease("bounce-in")(.75), 1e-6);
+      assert.inDelta(ease("elastic-out")(.25), 1 - ease("elastic-in")(.75), 1e-6);
+    },
+    "the -in-out suffix returns the reflection": function(ease) {
+      assert.inDelta(ease("sin-in-out")(.25), .5 * ease("sin-in")(.5), 1e-6);
+      assert.inDelta(ease("bounce-in-out")(.25), .5 * ease("bounce-in")(.5), 1e-6);
+      assert.inDelta(ease("elastic-in-out")(.25), .5 * ease("elastic-in")(.5), 1e-6);
+    },
+    "the -out-in suffix returns the reverse reflection": function(ease) {
+      assert.inDelta(ease("sin-out-in")(.25), .5 * ease("sin-out")(.5), 1e-6);
+      assert.inDelta(ease("bounce-out-in")(.25), .5 * ease("bounce-out")(.5), 1e-6);
+      assert.inDelta(ease("elastic-out-in")(.25), .5 * ease("elastic-out")(.5), 1e-6);
+    },
+    "clamps input time": function(ease) {
+      var e = ease("linear");
+      assert.inDelta(e(-1), 0, 1e-6);
+      assert.inDelta(e(2), 1, 1e-6);
+    },
+    "poly": {
+      "supports an optional polynomial": function(ease) {
+        var e = ease("poly", 1);
+        assert.inDelta(e(.5), .5, 1e-6);
+        var e = ease("poly", .5);
+        assert.inDelta(e(.5), Math.SQRT1_2, 1e-6);
+      }
+    },
+    "elastic": {
+      "supports an optional amplifier (>1)": function(ease) {
+        var e = ease("elastic", 1.5);
+        assert.inDelta(e(.5), 0.998519, 1e-6);
+      },
+      "supports an optional amplifier (>1) and period (>0)": function(ease) {
+        var e = ease("elastic", 1.5, .5);
+        assert.inDelta(e(.5), 0.96875, 1e-6);
+      }
+    },
+    "back": {
+      "supports an optional speed": function(ease) {
+        var e = ease("back", 2);
+        assert.inDelta(e(.5), -0.125, 1e-6);
+      }
+    }
+  }
+});
+
+suite.export(module);