stripchart 0.0.3

data/lib/stripchart/public/components/d3/test/layout/pack-test.js

@@ -0,0 +1,129 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.layout.pack");
+
+suite.addBatch({
+  "pack": {
+    topic: load("layout/pack").expression("d3.layout.pack"),
+    "can handle an empty children array": function(pack) {
+      var p = pack();
+      assert.deepEqual(p.nodes({children: [{children: []}, {value: 1}]}).map(layout), [
+        {value: 1, depth: 0, x: 0.5, y: 0.5, r: 0.5},
+        {value: 0, depth: 1, x: 0.0, y: 0.5, r: 0.0},
+        {value: 1, depth: 1, x: 0.5, y: 0.5, r: 0.5}
+      ]);
+    },
+    "can handle zero-valued nodes": function(pack) {
+      var p = pack();
+      assert.deepEqual(p.nodes({children: [{value: 0}, {value: 1}]}).map(layout), [
+        {value: 1, depth: 0, x: 0.5, y: 0.5, r: 0.5},
+        {value: 0, depth: 1, x: 0.0, y: 0.5, r: 0.0},
+        {value: 1, depth: 1, x: 0.5, y: 0.5, r: 0.5}
+      ]);
+    },
+    "can handle small nodes": function(pack) {
+      assert.deepEqual(pack().sort(null).nodes({children: [
+        {value: .01},
+        {value: 2},
+        {value: 2},
+        {value: 1}
+      ]}).map(layout), [
+        {y: 0.5, x: 0.5, value: 5.01, r: 0.5, depth: 0},
+        {y: 0.5084543199854831, x: 0.4682608366855136, value: 0.01, r: 0.016411496513964046, depth: 1},
+        {y: 0.5084543199854831, x: 0.7167659426883449, value: 2, r: 0.23209360948886723, depth: 1},
+        {y: 0.34256315498862167, x: 0.2832340573116551, value: 2, r: 0.23209360948886723, depth: 1},
+        {y: 0.7254154893606051, x: 0.38524055061025186, value: 1, r: 0.16411496513964044, depth: 1}
+      ]);
+      assert.deepEqual(pack().sort(null).nodes({children: [
+        {value: 2},
+        {value: 2},
+        {value: 1},
+        {value: .01}
+      ]}).map(layout), [
+        {y: 0.5, x: 0.5, value: 5.01, r: 0.5, depth: 0},
+        {y: 0.6274712284943809, x: 0.26624891409386664, value: 2, r: 0.23375108590613333, depth: 1},
+        {y: 0.6274712284943809, x: 0.7337510859061334, value: 2, r: 0.23375108590613333, depth: 1},
+        {y: 0.30406466355343187, x: 0.5, value: 1, r: 0.1652869779539461, depth: 1},
+        {y: 0.3878967195987758, x: 0.3386645534068854, value: 0.01, r: 0.01652869779539461, depth: 1}
+      ]);
+    },
+    "can handle residual floating point error": function(pack) {
+      var p = pack();
+      var result = p.nodes({children: [
+        {value: 0.005348322447389364},
+        {value: 0.8065882022492588},
+        {value: 0}
+      ]}).map(layout);
+      assert.isFalse(result.map(function(d) { return d.depth; }).some(isNaN));
+      assert.isFalse(result.map(function(d) { return d.value; }).some(isNaN));
+      assert.isFalse(result.map(function(d) { return d.x; }).some(isNaN));
+      assert.isFalse(result.map(function(d) { return d.y; }).some(isNaN));
+      assert.isFalse(result.map(function(d) { return d.r; }).some(isNaN));
+    },
+    "avoids coincident circles": function(pack) {
+      var p = pack();
+      var result = p({children: [
+        {children: [{value: 17010}, {value: 5842}, {value: 0}, {value: 0}]},
+        {children: [
+          {children: [{value: 721}, {value: 4294}, {value: 9800}, {value: 1314}, {value: 2220}]},
+          {value: 1759}, {value: 2165}, {value: 586}, {value: 3331}, {value: 772}, {value: 3322}
+        ]}
+      ]}).map(layout);
+      result.sort(function(a, b) {
+        return a.x < b.x && a.y < b.y ? -1 : 1;
+      });
+      assert.isFalse(result.slice(1).some(function(d, i) {
+        return d.x === result[i].x && d.y === result[i].y && d.value > 0;
+      }));
+    },
+    "radius defaults to automatic scaling": function(pack) {
+      assert.equal(pack().radius(), null);
+    },
+    "radius can be specified using a custom function of value": function(pack) {
+      var r = function(value) { return Math.sqrt(value) * 10; },
+          p = pack().radius(r);
+      assert.strictEqual(p.radius(), r);
+      assert.deepEqual(p.nodes({children: [{value: 1}]}).map(layout), [
+        {value: 1, depth: 0, x: 0.5, y: 0.5, r: 10},
+        {value: 1, depth: 1, x: 0.5, y: 0.5, r: 10}
+      ]);
+    },
+    "radius can be specified as a constant": function(pack) {
+      var p = pack().radius(5);
+      assert.equal(p.radius(), 5);
+      assert.deepEqual(p.nodes({children: [{value: 1}]}).map(layout), [
+        {value: 1, depth: 0, x: 0.5, y: 0.5, r: 5},
+        {value: 1, depth: 1, x: 0.5, y: 0.5, r: 5}
+      ]);
+    },
+    "radius constant value is coerced to a number": function(pack) {
+      var p = pack().radius("5");
+      assert.equal(p.radius(), 5);
+      assert.deepEqual(p.nodes({children: [{value: 1}]}).map(layout), [
+        {value: 1, depth: 0, x: 0.5, y: 0.5, r: 5},
+        {value: 1, depth: 1, x: 0.5, y: 0.5, r: 5}
+      ]);
+    },
+    "radius function value is coerced to a number": function(pack) {
+      var p = pack().radius(function() { return "5"; });
+      assert.deepEqual(p.nodes({children: [{value: 1}]}).map(layout), [
+        {value: 1, depth: 0, x: 0.5, y: 0.5, r: 5},
+        {value: 1, depth: 1, x: 0.5, y: 0.5, r: 5}
+      ]);
+    }
+  }
+});
+
+function layout(node) {
+  return {
+    value: node.value,
+    depth: node.depth,
+    r: node.r,
+    x: node.x,
+    y: node.y
+  };
+}
+
+suite.export(module);

data/lib/stripchart/public/components/d3/test/layout/partition-test.js

@@ -0,0 +1,45 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.layout.partition");
+
+suite.addBatch({
+  "partition": {
+    topic: load("layout/partition").expression("d3.layout.partition"),
+    "ignores zero values": function(partition) {
+      var p = partition().size([3, 3]);
+      assert.deepEqual(p.nodes({children: [{value: 1}, {value: 0}, {value: 2}, {children: [{value: 0}, {value: 0}]}]}).map(metadata), [
+        {x: 0, y: 0, dx: 3, dy: 1},
+        {x: 2, y: 1, dx: 1, dy: 1},
+        {x: 3, y: 1, dx: 0, dy: 1},
+        {x: 0, y: 1, dx: 2, dy: 1},
+        {x: 3, y: 1, dx: 0, dy: 1},
+        {x: 3, y: 2, dx: 0, dy: 1},
+        {x: 3, y: 2, dx: 0, dy: 1}
+      ]);
+    },
+    "can handle an empty children array": function(partition) {
+      var p = partition();
+      assert.deepEqual(p.nodes({children: []}).map(metadata), [
+        {x: 0, y: 0, dx: 1, dy: 1}
+      ]);
+      assert.deepEqual(p.nodes({children: [{children: []}, {value: 1}]}).map(metadata), [
+        {x: 0, y: 0,   dx: 1, dy: 0.5},
+        {x: 1, y: 0.5, dx: 0, dy: 0.5},
+        {x: 0, y: 0.5, dx: 1, dy: 0.5}
+      ]);
+    }
+  }
+});
+
+function metadata(node) {
+  var metadata = {};
+  if ("x" in node) metadata.x = node.x;
+  if ("y" in node) metadata.y = node.y;
+  if ("dx" in node) metadata.dx = node.dx;
+  if ("dy" in node) metadata.dy = node.dy;
+  return metadata;
+}
+
+suite.export(module);

data/lib/stripchart/public/components/d3/test/layout/pie-test.js

@@ -0,0 +1,24 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.layout.pie");
+
+suite.addBatch({
+  "pie": {
+    topic: load("layout/pie").expression("d3.layout.pie"),
+    "arcs are in same order as original data": function(pie) {
+      var p = pie();
+      assert.deepEqual(p([5, 30, 15]).map(function(d) { return d.data; }), [
+        5, 30, 15
+      ]);
+      assert.deepEqual(p([
+        84, 90, 48, 61, 58, 8, 6, 31, 45, 18
+      ]).map(function(d) { return d.data; }), [
+        84, 90, 48, 61, 58, 8, 6, 31, 45, 18
+      ]);
+    }
+  }
+});
+
+suite.export(module);

data/lib/stripchart/public/components/d3/test/layout/tree-test.js

@@ -0,0 +1,45 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.layout.tree");
+
+suite.addBatch({
+  "tree": {
+    topic: load("layout/tree").expression("d3.layout.tree"),
+    "can handle an empty children array": function(tree) {
+      var t = tree();
+      assert.deepEqual(t.nodes({children: []}).map(layout), [
+        {depth: 0, x: 0.5, y: 0}
+      ]);
+      assert.deepEqual(t.nodes({children: [
+        {children: []},
+        {children: [{}]},
+        {children: [{}]}
+      ]}).map(layout), [
+        {depth: 0, x: .5,   y: 0},
+        {depth: 1, x: .125, y: 0.5},
+        {depth: 1, x: .375, y: 0.5},
+        {depth: 2, x: .375, y: 1},
+        {depth: 1, x: .875, y: 0.5},
+        {depth: 2, x: .875, y: 1}
+      ]);
+    },
+    "can handle a single node": function(tree) {
+      var t = tree();
+      assert.deepEqual(t.nodes({value: 0}).map(layout), [
+        {depth: 0, x: 0.5, y: 0}
+      ]);
+    }
+  }
+});
+
+function layout(node) {
+  return {
+    depth: node.depth,
+    x: node.x,
+    y: node.y
+  };
+}
+
+suite.export(module);

data/lib/stripchart/public/components/d3/test/layout/treemap-test.js

@@ -0,0 +1,181 @@
+var vows = require("vows"),
+    load = require("../load"),
+    assert = require("../assert");
+
+var suite = vows.describe("d3.layout.treemap");
+
+suite.addBatch({
+  "treemap": {
+    topic: load("layout/treemap").expression("d3.layout.treemap"),
+    "outputs a squarified treemap": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null);
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 0, y: 833, dx: 1000, dy: 167},
+        {x: 600, y: 0, dx: 400, dy: 833},
+        {x: 0, y: 0, dx: 600, dy: 833},
+        {x: 0, y: 555, dx: 600, dy: 278},
+        {x: 0, y: 0, dx: 600, dy: 555}
+      ]);
+    },
+    "sorts by value by default": function(treemap) {
+      var t = treemap().size([1000, 1000]);
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 0, y: 0, dx: 333, dy: 500},
+        {x: 333, y: 0, dx: 667, dy: 500},
+        {x: 0, y: 500, dx: 1000, dy: 500},
+        {x: 0, y: 500, dx: 333, dy: 500},
+        {x: 333, y: 500, dx: 667, dy: 500}
+      ]);
+    },
+    "ignores zero values": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null);
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 0}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 0, y: 833, dx: 1000, dy: 167},
+        {x: 1000, y: 0, dx: 0, dy: 833},
+        {x: 600, y: 0, dx: 400, dy: 833},
+        {x: 0, y: 0, dx: 600, dy: 833},
+        {x: 0, y: 555, dx: 600, dy: 278},
+        {x: 0, y: 0, dx: 600, dy: 555}
+      ]);
+    },
+    "ignores NaN values": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null);
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: NaN}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 0, y: 833, dx: 1000, dy: 167},
+        {x: 1000, y: 0, dx: 0, dy: 833},
+        {x: 600, y: 0, dx: 400, dy: 833},
+        {x: 0, y: 0, dx: 600, dy: 833},
+        {x: 0, y: 555, dx: 600, dy: 278},
+        {x: 0, y: 0, dx: 600, dy: 555}
+      ]);
+    },
+    "does not overflow empty size": function(treemap) {
+      var t = treemap().size([0, 0]).sort(null);
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 0, dy: 0},
+        {x: 0, y: 0, dx: 0, dy: 0},
+        {x: 0, y: 0, dx: 0, dy: 0},
+        {x: 0, y: 0, dx: 0, dy: 0},
+        {x: 0, y: 0, dx: 0, dy: 0},
+        {x: 0, y: 0, dx: 0, dy: 0}
+      ]);
+    },
+    "can specify padding as a number": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null).padding(1);
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 1, y: 833, dx: 998, dy: 166},
+        {x: 600, y: 1, dx: 399, dy: 832},
+        {x: 1, y: 1, dx: 599, dy: 832},
+        {x: 2, y: 555, dx: 597, dy: 277},
+        {x: 2, y: 2, dx: 597, dy: 553}
+      ]);
+    },
+    "can specify padding as an array": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null).padding([1,2,3,4]);
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 4, y: 831, dx: 994, dy: 166},
+        {x: 600, y: 1, dx: 398, dy: 830},
+        {x: 4, y: 1, dx: 596, dy: 830},
+        {x: 8, y: 553, dx: 590, dy: 275},
+        {x: 8, y: 2, dx: 590, dy: 551}
+      ]);
+    },
+    "can specify padding as null": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null).padding(null);
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 0, y: 833, dx: 1000, dy: 167},
+        {x: 600, y: 0, dx: 400, dy: 833},
+        {x: 0, y: 0, dx: 600, dy: 833},
+        {x: 0, y: 555, dx: 600, dy: 278},
+        {x: 0, y: 0, dx: 600, dy: 555}
+      ]);
+    },
+    "can specify padding as a function that returns a number": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null).padding(function(d) { return d.depth; });
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 0, y: 833, dx: 1000, dy: 167},
+        {x: 600, y: 0, dx: 400, dy: 833},
+        {x: 0, y: 0, dx: 600, dy: 833},
+        {x: 1, y: 555, dx: 598, dy: 277},
+        {x: 1, y: 1, dx: 598, dy: 554}
+      ]);
+    },
+    "can specify padding as a function that returns an array": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null).padding(function(d) { return [d.depth,2,3,4]; });
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 4, y: 831, dx: 994, dy: 166},
+        {x: 600, y: 0, dx: 398, dy: 831},
+        {x: 4, y: 0, dx: 596, dy: 831},
+        {x: 8, y: 552, dx: 590, dy: 276},
+        {x: 8, y: 1, dx: 590, dy: 551}
+      ]);
+    },
+    "can specify padding as a function that returns null": function(treemap) {
+      var t = treemap().size([1000, 1000]).sort(null).padding(function(d) { return d.depth & 1 ? null : 1; });
+      assert.deepEqual(t.nodes({children: [{value: 1}, {value: 2}, {children: [{value: 1}, {value: 2}]}]}).map(layout), [
+        {x: 0, y: 0, dx: 1000, dy: 1000},
+        {x: 1, y: 833, dx: 998, dy: 166},
+        {x: 600, y: 1, dx: 399, dy: 832},
+        {x: 1, y: 1, dx: 599, dy: 832},
+        {x: 1, y: 556, dx: 599, dy: 277},
+        {x: 1, y: 1, dx: 599, dy: 555}
+      ]);
+    },
+    "no negatively sized rectangles": function(treemap) {
+      var t = treemap().size([615, 500]).sort(function(a, b) { return a.value - b.value; }).padding(29),
+          data = [1, 9, 3, 15, 44, 28, 32, 41, 50, 60, 64, 75, 76, 84, 88, 100, 140, 142, 363, 657, 670, 822, 1173, 1189],
+          nodes = t.nodes({children: data.map(function(d) { return {value: d}; })}).map(layout);
+      assert.equal(nodes.filter(function(n) { return n.dx < 0 || n.dy < 0; }).length, 0);
+    },
+    "no overhanging rectangles": function(treemap) {
+      var t = treemap().size([100, 100]).sort(function(a, b) { return a.value - b.value; }),
+          data = [0, 0, 81681.85, 370881.9, 0, 0, 0, 255381.59, 0, 0, 0, 0, 0, 0, 0, 125323.95, 0, 0, 0, 186975.07, 185707.05, 267370.93, 0],
+          nodes = t.nodes({children: data.map(function(d) { return {value: d}; })}).map(layout);
+      assert.equal(nodes.filter(function(n) { return n.dx < 0 || n.dy < 0 || n.x + n.dx > 100 || n.y + n.dy > 100; }).length, 0);
+    },
+    "can handle an empty children array": function(treemap) {
+      assert.deepEqual(treemap().nodes({children: []}).map(layout), [
+        {x: 0, y: 0, dx: 1, dy: 1}
+      ]);
+      assert.deepEqual(treemap().nodes({children: [{children: []}, {value: 1}]}).map(layout), [
+        {x: 0, y: 0, dx: 1, dy: 1},
+        {x: 0, y: 0, dx: 0, dy: 1},
+        {x: 0, y: 0, dx: 1, dy: 1}
+      ]);
+    },
+    "slice-dice": function(treemap) {
+      assert.deepEqual(treemap().size([100, 10]).mode("slice-dice").nodes({children: [
+        {children: [{value: 1}, {value: 1}]},
+        {children: [{value: 1}, {value: 1}]}
+      ]}).map(layout), [
+        {x: 0, y: 0, dx: 100, dy: 10},
+        {x: 50, y: 0, dx: 50, dy: 10},
+        {x: 50, y: 5, dx: 50, dy: 5},
+        {x: 50, y: 0, dx: 50, dy: 5},
+        {x: 0, y: 0, dx: 50, dy: 10},
+        {x: 0, y: 5, dx: 50, dy: 5},
+        {x: 0, y: 0, dx: 50, dy: 5}
+      ]);
+    }
+  }
+});
+
+function layout(node) {
+  return {
+    x: node.x,
+    y: node.y,
+    dx: node.dx,
+    dy: node.dy
+  };
+}
+
+suite.export(module);

data/lib/stripchart/public/components/d3/test/load.js

@@ -0,0 +1,58 @@
+process.env.TZ = "America/Los_Angeles";
+
+var smash = require("smash"),
+    jsdom = require("jsdom");
+
+require("./XMLHttpRequest");
+
+module.exports = function() {
+  var files = [].slice.call(arguments).map(function(d) { return "src/" + d; }),
+      expression = "d3",
+      sandbox = {console: console, Date: Date}; // so we can use deepEqual in tests
+
+  files.unshift("src/start");
+  files.push("src/end");
+
+  function topic() {
+    var callback = this.callback;
+    smash.load(files, expression, sandbox, function(error, result) {
+      if (error) console.trace(error.stack);
+      callback(error, result);
+    });
+  }
+
+  topic.expression = function(_) {
+    expression = _;
+    return topic;
+  };
+
+  topic.document = function(_) {
+    var document = jsdom.jsdom("<html><head></head><body></body></html>");
+
+    // Monkey-patch createRange support to JSDOM.
+    document.createRange = function() {
+      return {
+        selectNode: function() {},
+        createContextualFragment: jsdom.jsdom
+      };
+    };
+
+    sandbox = {
+      console: console,
+      XMLHttpRequest: XMLHttpRequest,
+      document: document,
+      window: document.createWindow(),
+      setTimeout: setTimeout,
+      clearTimeout: clearTimeout,
+      Date: Date // so we can override Date.now in tests, and use deepEqual
+    };
+
+    return topic;
+  };
+
+  return topic;
+};
+
+process.on("uncaughtException", function(e) {
+  console.trace(e.stack);
+});