d3_rails 2.9.1 → 2.9.2.rc1

data/vendor/assets/javascripts/tesseract/tesseract.min.js

@@ -1 +0,0 @@
-(function(a){function b(a){return a}function c(a,b){for(var c=0,d=b.length,e=new Array(d);c<d;++c)e[c]=a[b[c]];return e}function e(a){function b(b,c,d,e){while(d<e){var f=d+e>>1;a(b[f])<c?d=f+1:e=f}return d}function c(b,c,d,e){while(d<e){var f=d+e>>1;c<a(b[f])?e=f:d=f+1}return d}return c.right=c,c.left=b,c}function h(a){function b(a,b,c){var e=c-b,f=(e>>>1)+1;while(--f>0)d(a,f,e,b);return a}function c(a,b,c){var e=c-b,f;while(--e>0)f=a[b],a[b]=a[b+e],a[b+e]=f,d(a,1,e,b);return a}function d(b,c,d,e){var f=b[--e+c],g=a(f),h;while((h=c<<1)<=d){h<d&&a(b[e+h])>a(b[e+h+1])&&h++;if(g<=a(b[e+h]))break;b[e+c]=b[e+h],c=h}b[e+c]=f}return b.sort=c,b}function j(a){function c(c,d,e,f){var g=new Array(f=Math.min(e-d,f)),h,i,j,k;for(i=0;i<f;++i)g[i]=c[d++];b(g,0,f);if(d<e){h=a(g[0]);do if(j=a(k=c[d])>h)g[0]=k,h=a(b(g,0,f)[0]);while(++d<e)}return g}var b=h(a);return c}function l(a){function b(b,c,d){for(var e=c+1;e<d;++e){for(var f=e,g=b[e],h=a(g);f>c&&a(b[f-1])>h;--f)b[f]=b[f-1];b[f]=g}return b}return b}function n(a){function c(a,c,e){return(e-c<o?b:d)(a,c,e)}function d(b,d,e){var f=(e-d)/6|0,g=d+f,h=e-1-f,i=d+e-1>>1,j=i-f,k=i+f,l=b[g],m=a(l),n=b[j],o=a(n),p=b[i],q=a(p),r=b[k],s=a(r),u=b[h],v=a(u);m>o&&(t=l,l=n,n=t,t=m,m=o,o=t),s>v&&(t=r,r=u,u=t,t=s,s=v,v=t),m>q&&(t=l,l=p,p=t,t=m,m=q,q=t),o>q&&(t=n,n=p,p=t,t=o,o=q,q=t),m>s&&(t=l,l=r,r=t,t=m,m=s,s=t),q>s&&(t=p,p=r,r=t,t=q,q=s,s=t),o>v&&(t=n,n=u,u=t,t=o,o=v,v=t),o>q&&(t=n,n=p,p=t,t=o,o=q,q=t),s>v&&(t=r,r=u,u=t,t=s,s=v,v=t);var w=n,x=o,y=r,z=s;b[g]=l,b[j]=b[d],b[i]=p,b[k]=b[e-1],b[h]=u;var A=d+1,B=e-2,C=x<=z&&x>=z;if(C)for(var D=A;D<=B;++D){var E=b[D],F=a(E);if(F<x)D!==A&&(b[D]=b[A],b[A]=E),++A;else if(F>x)for(;;){var G=a(b[B]);if(G>x){B--;continue}if(G<x){b[D]=b[A],b[A++]=b[B],b[B--]=E;break}b[D]=b[B],b[B--]=E;break}}else for(var D=A;D<=B;D++){var E=b[D],F=a(E);if(F<x)D!==A&&(b[D]=b[A],b[A]=E),++A;else if(F>z)for(;;){var G=a(b[B]);if(G>z){B--;if(B<D)break;continue}G<x?(b[D]=b[A],b[A++]=b[B],b[B--]=E):(b[D]=b[B],b[B--]=E);break}}b[d]=b[A-1],b[A-1]=w,b[e-1]=b[B+1],b[B+1]=y,c(b,d,A-1),c(b,B+2,e);if(C)return b;if(A<g&&B>h){var H,G;while((H=a(b[A]))<=x&&H>=x)++A;while((G=a(b[B]))<=z&&G>=z)--B;for(var D=A;D<=B;D++){var E=b[D],F=a(E);if(F<=x&&F>=x)D!==A&&(b[D]=b[A],b[A]=E),A++;else if(F<=z&&F>=z)for(;;){var G=a(b[B]);if(G<=z&&G>=z){B--;if(B<D)break;continue}G<x?(b[D]=b[A],b[A++]=b[B],b[B--]=E):(b[D]=b[B],b[B--]=E);break}}}return c(b,A,B+1)}var b=l(a);return c}function v(a){return new Array(a)}function w(a,b){return function(c){var d=c.length;return[a.left(c,b,0,d),a.right(c,b,0,d)]}}function x(a,b){var c=b[0],d=b[1];return function(b){var e=b.length;return[a.left(b,c,0,e),a.left(b,d,0,e)]}}function y(a){return[0,a.length]}function z(){return null}function A(){return 0}function B(a){return a+1}function C(a){return a-1}function D(a){return function(b,c){return b+ +a(c)}}function E(a){return function(b,c){return b-a(c)}}function F(){function q(b){var c=f,d=b.length;return d&&(e=e.concat(b),l=s(l,f+=d),o.forEach(function(a){a(b,c,d)})),a}function r(a){function Q(b,d,e){F=b.map(a),J=K(H(e),0,e),F=c(F,J);var g=L(F),h=g[0],i=g[1],j;for(j=0;j<h;++j)l[J[j]+d]|=q;for(j=i;j<e;++j)l[J[j]+d]|=q;if(!d){t=F,v=J,O=h,P=i;return}var k=t,m=v,n=0,o=0;t=new Array(f),v=G(f,f);for(j=0;n<d&&o<e;++j)k[n]<F[o]?(t[j]=k[n],v[j]=m[n++]):(t[j]=F[o],v[j]=J[o++]+d);for(;n<d;++n,++j)t[j]=k[n],v[j]=m[n];for(;o<e;++o,++j)t[j]=F[o],v[j]=J[o]+d;g=L(t),O=g[0],P=g[1]}function R(a,b,c){N.forEach(function(a){a(F,J,b,c)}),F=J=null}function S(a){var b,c,d,e=a[0],f=a[1],g=[],h=[];if(e<O)for(b=e,c=Math.min(O,f);b<c;++b)l[d=v[b]]^=q,g.push(d);else if(e>O)for(b=O,c=Math.min(e,P);b<c;++b)l[d=v[b]]^=q,h.push(d);if(f>P)for(b=Math.max(e,P),c=f;b<c;++b)l[d=v[b]]^=q,g.push(d);else if(f<P)for(b=Math.max(O,f),c=P;b<c;++b)l[d=v[b]]^=q,h.push(d);return O=e,P=f,m.forEach(function(a){a(q,g,h)}),p}function T(a){return a==null?W():Array.isArray(a)?V(a):U(a)}function U(a){return S((L=w(d,a))(t))}function V(a){return S((L=x(d,a))(t))}function W(){return S((L=y)(t))}function X(a){var b=[],c=P,d;while(--c>=O&&a>0)l[d=v[c]]||(b.push(e[d]),--a);return b}function Y(a){function L(b,c,g,h){function N(){++o===n&&(p=u(p,k<<=1),i=u(i,k),n=I(k))}var j=d,p=G(o,n),q=x,t=F,v=o,w=0,y=0,A,B,C,D,E,L;K&&(q=t=z),d=new Array(o),o=0,i=v>1?s(i,f):G(f,n),v&&(C=(B=j[0]).key);while(y<h&&!((D=a(b[y]))>=D))++y;while(y<h){if(B&&C<=D){E=B,L=C,p[w]=o;if(B=j[++w])C=B.key}else E={key:D,value:t()},L=D;d[o]=E;while(!(D>L)){i[A=c[y]+g]=o,l[A]&r||(E.value=q(E.value,e[A]));if(++y>=h)break;D=a(b[y])}N()}while(w<v)d[p[w]=o]=j[w++],N();if(o>w)for(w=0;w<g;++w)i[w]=p[i[w]];A=m.indexOf(H),o>1?(H=M,J=P):(o===1?(H=O,J=Q):(H=z,J=z),i=null),m[A]=H}function M(a,b,c){if(a===q||K)return;var f,h,j;for(f=0,j=b.length;f<j;++f)l[h=b[f]]&r||(g=d[i[h]],g.value=x(g.value,e[h]));for(f=0,j=c.length;f<j;++f)(l[h=c[f]]&r)===a&&(g=d[i[h]],g.value=y(g.value,e[h]))}function O(a,b,c){if(a===q||K)return;var f,g,h,i=d[0];for(f=0,h=b.length;f<h;++f)l[g=b[f]]&r||(i.value=x(i.value,e[g]));for(f=0,h=c.length;f<h;++f)(l[g=c[f]]&r)===a&&(i.value=y(i.value,e[g]))}function P(){var a,b;for(a=0;a<o;++a)d[a].value=F();for(a=0;a<f;++a)l[a]&r||(b=d[i[a]],b.value=x(b.value,e[a]))}function Q(){var a,b=d[0];b.value=F();for(a=0;a<f;++a)l[a]&r||(b.value=x(b.value,e[a]))}function R(){return K&&(J(),K=!1),d}function S(a){var b=p(R(),0,d.length,a);return w.sort(b,0,b.length)}function T(a,b,d){return x=a,y=b,F=d,K=!0,c}function U(){return T(B,C,A)}function V(a){return T(D(a),E(a),A)}function W(a){function b(b){return a(b.value)}return p=j(b),w=h(b),c}function X(){return W(b)}function Y(){return o}var c={top:S,all:R,reduce:T,reduceCount:U,reduceSum:V,order:W,orderNatural:X,size:Y},d,i,k=8,n=I(k),o=0,p,w,x,y,F,H=z,J=z,K=!0;return arguments.length<1&&(a=b),m.push(H),N.push(L),L(t,v,0,f),U().orderNatural()}function Z(){var a=Y(z),b=a.all;return delete a.all,delete a.top,delete a.order,delete a.orderNatural,delete a.size,a.value=function(){return b()[0].value},a}var p={filter:T,filterExact:U,filterRange:V,filterAll:W,top:X,group:Y,groupAll:Z},q=1<<i++,r=~q,t,v,F,J,K=n(function(a){return F[a]}),L=y,N=[],O=0,P=0;return o.unshift(Q),o.push(R),i>k&&(l=u(l,k<<=1)),Q(e,0,f),R(e,0,f),p}function t(){function i(a,d,g){var i;if(h)return;for(i=d;i<f;++i)l[i]||(b=c(b,e[i]))}function j(a,f,g){var i,j,k;if(h)return;for(i=0,k=f.length;i<k;++i)l[j=f[i]]||(b=c(b,e[j]));for(i=0,k=g.length;i<k;++i)l[j=g[i]]===a&&(b=d(b,e[j]))}function k(){var a;b=g();for(a=0;a<f;++a)l[a]||(b=c(b,e[a]))}function n(b,e,f){return c=b,d=e,g=f,h=!0,a}function p(){return n(B,C,A)}function q(a){return n(D(a),E(a),A)}function r(){return h&&(k(),h=!1),b}var a={reduce:n,reduceCount:p,reduceSum:q,value:r},b,c,d,g,h=!0;return m.push(j),o.push(i),i(e,0,f),p()}function v(){return f}var a={add:q,dimension:r,groupAll:t,size:v},e=[],f=0,i=0,k=8,l=p(0),m=[],o=[];return arguments.length?q(arguments[0]):a}function G(a,b){return(b<257?p:b<65537?q:r)(a)}function H(a){var b=G(a,a);for(var c=-1;++c<a;)b[c]=c;return b}function I(a){return a===8?256:a===16?65536:4294967296}F.version="1.0.1",F.permute=c;var d=F.bisect=e(b);d.by=e;var f=F.heap=h(b);f.by=h;var i=F.heapselect=j(b);i.by=j;var k=F.insertionsort=l(b);k.by=l;var m=F.quicksort=n(b);m.by=n;var o=32,p=v,q=v,r=v,s=b,u=b;typeof Uint8Array!="undefined"&&(p=function(a){return new Uint8Array(a)},q=function(a){return new Uint16Array(a)},r=function(a){return new Uint32Array(a)},s=function(a,b){var c=new a.constructor(b);return c.set(a),c},u=function(a,b){var c;switch(b){case 16:c=q(a.length);break;case 32:c=r(a.length);break;default:throw new Error("invalid array width!")}return c.set(a),c}),a.tesseract=F})(this);

data/vendor/assets/javascripts/tesseract/test/benchmark.js

@@ -1,177 +0,0 @@
-var tesseract = require("../"),
-    d3 = require("d3");
-
-var then,
-    then2;
-
-// Various generators for our synthetic dataset.
-var firstSize = 9e4,
-    secondSize = 1e4,
-    totalSize = firstSize + secondSize,
-    randomDayOfWeek = randomIndex([0, .6, .7, .75, .8, .76, 0]),
-    randomHourOfDay = randomIndex([0, 0, 0, 0, 0, 0, 0, .2, .5, .7, .85, .9, .8, .69, .72, .8, .78, .7, .3, 0, 0, 0, 0, 0]),
-    randomDate = randomRecentDate(randomDayOfWeek, randomHourOfDay, 13),
-    randomAmount = randomLogNormal(2.5, .5),
-    randomPayment = function() { return {date: randomDate(), amount: randomAmount()}; };
-
-// Various formatters to show our synthetic distributions.
-var x = d3.scale.linear().rangeRound([0, 20]),
-    dayNames = ["S", "M", "T", "W", "T", "F", "S"],
-    formatNumber = d3.format(",.02r"),
-    formatInteger = d3.format("8d"),
-    formatDate = d3.time.format("%x"),
-    formatDay = function(i) { return dayNames[i]; };
-
-// Create the synthetic records.
-then = Date.now();
-var paymentRecords = d3.range(totalSize).map(randomPayment);
-console.log("Synthesizing " + formatNumber(totalSize) + " records: " + formatNumber(Date.now() - then) + "ms.");
-
-// Slice the records into batches so we can measure incremental add.
-var firstBatch = paymentRecords.slice(0, firstSize),
-    secondBatch = paymentRecords.slice(firstSize);
-
-// Create the tesseract and relevant dimensions and groups.
-then = then2 = Date.now();
-var payments = tesseract(firstBatch),
-    all = payments.groupAll(),
-    amount = payments.dimension(function(d) { return d.amount; }),
-    amounts = amount.group(Math.floor),
-    date = payments.dimension(function(d) { return d.date; }),
-    dates = date.group(d3.time.day),
-    day = payments.dimension(function(d) { return d.date.getDay(); }),
-    days = day.group(),
-    hour = payments.dimension(function(d) { return d.date.getHours(); }),
-    hours = hour.group();
-console.log("Indexing " + formatNumber(firstSize) + " records: " + formatNumber(Date.now() - then) + "ms.");
-
-// Add the second batch incrementally.
-then = Date.now();
-payments.add(secondBatch);
-console.log("Indexing " + formatNumber(secondSize) + " records: " + formatNumber(Date.now() - then) + "ms.");
-console.log("Total indexing time: " + formatNumber(Date.now() - then2) + "ms.");
-console.log("");
-
-// Simulate filtering by dates.
-then = Date.now();
-var today = d3.time.day(new Date());
-for (var i = 0, n = 90, k = 0; i < n; ++i) {
-  var ti = d3.time.day.offset(today, -i);
-  for (var j = 0; j < i; ++j) {
-    var tj = d3.time.day.offset(today, -j);
-    date.filterRange([ti, tj]);
-    updateDisplay();
-  }
-}
-console.log("Filtering by date: " + formatNumber((Date.now() - then) / k) + "ms/op.");
-date.filterAll();
-
-// Simulate filtering by day.
-then = Date.now();
-for (var i = 0, n = 7, k = 0; i < n; ++i) {
-  for (var j = i; j < n; ++j) {
-    day.filterRange([i, j]);
-    updateDisplay();
-  }
-}
-console.log("Filtering by day: " + formatNumber((Date.now() - then) / k) + "ms/op.");
-day.filterAll();
-
-// Simulate filtering by hour.
-then = Date.now();
-for (var i = 0, n = 24, k = 0; i < n; ++i) {
-  for (var j = i; j < n; ++j) {
-    hour.filterRange([i, j]);
-    updateDisplay();
-  }
-}
-console.log("Filtering by hour: " + formatNumber((Date.now() - then) / k) + "ms/op.");
-hour.filterAll();
-
-// Simulate filtering by amount.
-then = Date.now();
-for (var i = 0, n = 35, k = 0; i < n; ++i) {
-  for (var j = i; j < n; ++j) {
-    amount.filterRange([i, j]);
-    updateDisplay();
-  }
-}
-console.log("Filtering by amount: " + formatNumber((Date.now() - then) / k) + "ms/op.");
-amount.filterAll();
-
-console.log("");
-console.log("Day of Week:");
-x.domain([0, days.top(1)[0].value]);
-days.all().forEach(function(g) {
-  console.log("       " + formatDay(g.key) + ": " + new Array(x(g.value) + 1).join("▇"));
-});
-console.log("");
-
-console.log("Hour of Day:");
-x.domain([0, hours.top(1)[0].value]);
-hours.all().forEach(function(g) {
-  console.log(formatInteger(g.key) + ": " + new Array(x(g.value) + 1).join("▇"));
-});
-console.log("");
-
-console.log("Date:");
-x.domain([0, dates.top(1)[0].value]);
-dates.all().forEach(function(g) {
-  console.log(formatDate(g.key) + ": " + new Array(x(g.value) + 1).join("▇"));
-});
-console.log("");
-
-console.log("Amount:");
-x.domain([0, amounts.top(1)[0].value]);
-amounts.all().filter(function(g) { return x(g.value); }).forEach(function(g) {
-  console.log(formatInteger(g.key) + ": " + new Array(x(g.value) + 1).join("▇"));
-});
-console.log("");
-
-// Simulates updating the display whenever the filters change.
-function updateDisplay() {
-  dates.all(); // update the date chart
-  days.all(); // update the day-of-week chart
-  hours.all(); // update the hour-of-day chart
-  amounts.all(); // update the amount histogram
-  all.value(); // update the summary totals
-  date.top(40); // update the payment list
-  ++k; // count frame rate
-}
-
-// Returns a function that returns random index in [0, distribution.length -
-// 1], based on the relative values in the specified distribution. Internally,
-// the distribution is converted to a normalized cumulative distribution in
-// [0, 1], and then a uniform random value is used with bisection.
-function randomIndex(distribution) {
-  var k = 1 / d3.sum(distribution), s = 0;
-  for (var i = 0, n = distribution.length; i < n; ++i) {
-    s = (distribution[i] = distribution[i] * k + s);
-  }
-  return function() {
-    return d3.bisectLeft(distribution, Math.random());
-  };
-}
-
-// Returns a function that returns random values with a log-normal
-// distribution, with the specified mean and deviation.
-function randomLogNormal(µ, σ) {
-  var random = d3.random.normal();
-  return function() {
-    return Math.exp(µ + σ * random());
-  };
-}
-
-// Returns a function that returns random dates, built on top of the specified
-// random day-of-week and hour-of-day generators. The minutes, seconds, and
-// milliseconds of the return dates are uniform random; as is the week of the
-// returned date, which is between now and some *weeks* ago.
-function randomRecentDate(randomDayOfWeek, randomHourOfDay, weeks) {
-  var now = Date.now();
-  return function() {
-    var d = d3.time.week.offset(new Date(), -Math.floor(Math.random() * weeks));
-    d.setDate(d.getDate() + randomDayOfWeek() - d.getDay());
-    d.setHours(randomHourOfDay(), Math.random() * 60, Math.random() * 60, Math.random() * 1000);
-    return d;
-  };
-}

data/vendor/assets/javascripts/tesseract/test/bisect-test.js

@@ -1,206 +0,0 @@
-var vows = require("vows"),
-    assert = require("assert"),
-    tesseract = require("../");
-
-var suite = vows.describe("bisect");
-
-suite.addBatch({
-  "bisect": {
-    topic: function() {
-      return tesseract.bisect;
-    },
-    "is the same as bisect.right": function(bisect) {
-      assert.strictEqual(bisect, bisect.right);
-    }
-  }
-});
-
-suite.addBatch({
-  "bisect.left": {
-    topic: function() {
-      return tesseract.bisect.left;
-    },
-    "finds the index of an exact match": function(bisect) {
-      var array = [1, 2, 3];
-      assert.equal(bisect(array, 1, 0, 3), 0);
-      assert.equal(bisect(array, 2, 0, 3), 1);
-      assert.equal(bisect(array, 3, 0, 3), 2);
-    },
-    "finds the index of the first match": function(bisect) {
-      var array = [1, 2, 2, 3];
-      assert.equal(bisect(array, 1, 0, 4), 0);
-      assert.equal(bisect(array, 2, 0, 4), 1);
-      assert.equal(bisect(array, 3, 0, 4), 3);
-    },
-    "finds the insertion point of a non-exact match": function(bisect) {
-      var array = [1, 2, 3];
-      assert.equal(bisect(array, 0.5, 0, 3), 0);
-      assert.equal(bisect(array, 1.5, 0, 3), 1);
-      assert.equal(bisect(array, 2.5, 0, 3), 2);
-      assert.equal(bisect(array, 3.5, 0, 3), 3);
-    },
-    "observes the lower bound": function(bisect) {
-      var array = [1, 2, 3, 4, 5];
-      assert.equal(bisect(array, 0, 2, 5), 2);
-      assert.equal(bisect(array, 1, 2, 5), 2);
-      assert.equal(bisect(array, 2, 2, 5), 2);
-      assert.equal(bisect(array, 3, 2, 5), 2);
-      assert.equal(bisect(array, 4, 2, 5), 3);
-      assert.equal(bisect(array, 5, 2, 5), 4);
-      assert.equal(bisect(array, 6, 2, 5), 5);
-    },
-    "observes the lower and upper bounds": function(bisect) {
-      var array = [1, 2, 3, 4, 5];
-      assert.equal(bisect(array, 0, 2, 3), 2);
-      assert.equal(bisect(array, 1, 2, 3), 2);
-      assert.equal(bisect(array, 2, 2, 3), 2);
-      assert.equal(bisect(array, 3, 2, 3), 2);
-      assert.equal(bisect(array, 4, 2, 3), 3);
-      assert.equal(bisect(array, 5, 2, 3), 3);
-      assert.equal(bisect(array, 6, 2, 3), 3);
-    }
-  }
-});
-
-suite.addBatch({
-  "bisect.by(value).left": {
-    topic: function() {
-      return tesseract.bisect.by(function(d) { return d.value; }).left;
-    },
-    "finds the index of an exact match": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 3}];
-      assert.equal(bisect(array, 1, 0, 3), 0);
-      assert.equal(bisect(array, 2, 0, 3), 1);
-      assert.equal(bisect(array, 3, 0, 3), 2);
-    },
-    "finds the index of the first match": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 2}, {value: 3}];
-      assert.equal(bisect(array, 1, 0, 4), 0);
-      assert.equal(bisect(array, 2, 0, 4), 1);
-      assert.equal(bisect(array, 3, 0, 4), 3);
-    },
-    "finds the insertion point of a non-exact match": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 3}];
-      assert.equal(bisect(array, 0.5, 0, 3), 0);
-      assert.equal(bisect(array, 1.5, 0, 3), 1);
-      assert.equal(bisect(array, 2.5, 0, 3), 2);
-      assert.equal(bisect(array, 3.5, 0, 3), 3);
-    },
-    "observes the lower bound": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 3}, {value: 4}, {value: 5}];
-      assert.equal(bisect(array, 0, 2, 5), 2);
-      assert.equal(bisect(array, 1, 2, 5), 2);
-      assert.equal(bisect(array, 2, 2, 5), 2);
-      assert.equal(bisect(array, 3, 2, 5), 2);
-      assert.equal(bisect(array, 4, 2, 5), 3);
-      assert.equal(bisect(array, 5, 2, 5), 4);
-      assert.equal(bisect(array, 6, 2, 5), 5);
-    },
-    "observes the lower and upper bounds": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 3}, {value: 4}, {value: 5}];
-      assert.equal(bisect(array, 0, 2, 3), 2);
-      assert.equal(bisect(array, 1, 2, 3), 2);
-      assert.equal(bisect(array, 2, 2, 3), 2);
-      assert.equal(bisect(array, 3, 2, 3), 2);
-      assert.equal(bisect(array, 4, 2, 3), 3);
-      assert.equal(bisect(array, 5, 2, 3), 3);
-      assert.equal(bisect(array, 6, 2, 3), 3);
-    }
-  }
-});
-
-suite.addBatch({
-  "bisect.right": {
-    topic: function() {
-      return tesseract.bisect.right;
-    },
-    "finds the index after an exact match": function(bisect) {
-      var array = [1, 2, 3];
-      assert.equal(bisect(array, 1, 0, 3), 1);
-      assert.equal(bisect(array, 2, 0, 3), 2);
-      assert.equal(bisect(array, 3, 0, 3), 3);
-    },
-    "finds the index after the last match": function(bisect) {
-      var array = [1, 2, 2, 3];
-      assert.equal(bisect(array, 1, 0, 4), 1);
-      assert.equal(bisect(array, 2, 0, 4), 3);
-      assert.equal(bisect(array, 3, 0, 4), 4);
-    },
-    "finds the insertion point of a non-exact match": function(bisect) {
-      var array = [1, 2, 3];
-      assert.equal(bisect(array, 0.5, 0, 3), 0);
-      assert.equal(bisect(array, 1.5, 0, 3), 1);
-      assert.equal(bisect(array, 2.5, 0, 3), 2);
-      assert.equal(bisect(array, 3.5, 0, 3), 3);
-    },
-    "observes the lower bound": function(bisect) {
-      var array = [1, 2, 3, 4, 5];
-      assert.equal(bisect(array, 0, 2, 5), 2);
-      assert.equal(bisect(array, 1, 2, 5), 2);
-      assert.equal(bisect(array, 2, 2, 5), 2);
-      assert.equal(bisect(array, 3, 2, 5), 3);
-      assert.equal(bisect(array, 4, 2, 5), 4);
-      assert.equal(bisect(array, 5, 2, 5), 5);
-      assert.equal(bisect(array, 6, 2, 5), 5);
-    },
-    "observes the lower and upper bounds": function(bisect) {
-      var array = [1, 2, 3, 4, 5];
-      assert.equal(bisect(array, 0, 2, 3), 2);
-      assert.equal(bisect(array, 1, 2, 3), 2);
-      assert.equal(bisect(array, 2, 2, 3), 2);
-      assert.equal(bisect(array, 3, 2, 3), 3);
-      assert.equal(bisect(array, 4, 2, 3), 3);
-      assert.equal(bisect(array, 5, 2, 3), 3);
-      assert.equal(bisect(array, 6, 2, 3), 3);
-    }
-  }
-});
-
-suite.addBatch({
-  "bisect.by(value).right": {
-    topic: function() {
-      return tesseract.bisect.by(function(d) { return d.value; }).right;
-    },
-    "finds the index after an exact match": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 3}];
-      assert.equal(bisect(array, 1, 0, 3), 1);
-      assert.equal(bisect(array, 2, 0, 3), 2);
-      assert.equal(bisect(array, 3, 0, 3), 3);
-    },
-    "finds the index after the last match": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 2}, {value: 3}];
-      assert.equal(bisect(array, 1, 0, 4), 1);
-      assert.equal(bisect(array, 2, 0, 4), 3);
-      assert.equal(bisect(array, 3, 0, 4), 4);
-    },
-    "finds the insertion point of a non-exact match": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 3}];
-      assert.equal(bisect(array, 0.5, 0, 3), 0);
-      assert.equal(bisect(array, 1.5, 0, 3), 1);
-      assert.equal(bisect(array, 2.5, 0, 3), 2);
-      assert.equal(bisect(array, 3.5, 0, 3), 3);
-    },
-    "observes the lower bound": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 3}, {value: 4}, {value: 5}];
-      assert.equal(bisect(array, 0, 2, 5), 2);
-      assert.equal(bisect(array, 1, 2, 5), 2);
-      assert.equal(bisect(array, 2, 2, 5), 2);
-      assert.equal(bisect(array, 3, 2, 5), 3);
-      assert.equal(bisect(array, 4, 2, 5), 4);
-      assert.equal(bisect(array, 5, 2, 5), 5);
-      assert.equal(bisect(array, 6, 2, 5), 5);
-    },
-    "observes the lower and upper bounds": function(bisect) {
-      var array = [{value: 1}, {value: 2}, {value: 3}, {value: 4}, {value: 5}];
-      assert.equal(bisect(array, 0, 2, 3), 2);
-      assert.equal(bisect(array, 1, 2, 3), 2);
-      assert.equal(bisect(array, 2, 2, 3), 2);
-      assert.equal(bisect(array, 3, 2, 3), 3);
-      assert.equal(bisect(array, 4, 2, 3), 3);
-      assert.equal(bisect(array, 5, 2, 3), 3);
-      assert.equal(bisect(array, 6, 2, 3), 3);
-    }
-  }
-});
-
-suite.export(module);

data/vendor/assets/javascripts/tesseract/test/heap-test.js

@@ -1,44 +0,0 @@
-var vows = require("vows"),
-    assert = require("assert"),
-    tesseract = require("../");
-
-var suite = vows.describe("heap");
-
-suite.addBatch({
-  "heap": {
-    topic: function() {
-      return tesseract.heap;
-    },
-    "children are greater than or equal to parents": function(heap) {
-      var array = [6, 5, 3, 1, 8, 7, 2, 4]
-          n = array.length;
-      assert.strictEqual(heap(array, 0, n), array);
-      assert.equal(array[0], 1);
-      for (var i = 1; i < n; ++i) assert(array[i] >= array[i - 1 >> 1]);
-    },
-    "creates a heap from a subset of the array": function(heap) {
-      var array = [6, 5, 3, 1, 8, 7, 2, 4]
-          n = 6;
-      assert.strictEqual(heap(array, 0, n), array);
-      assert.equal(array[0], 1);
-      for (var i = 1; i < n; ++i) assert(array[i] >= array[i - 1 >> 1]);
-    },
-
-    "sort": {
-      "sorts an existing heap in descending order": function(heap) {
-        var array = [1, 4, 2, 5, 8, 7, 3, 6],
-            n = array.length;
-        heap.sort(array, 0, n);
-        assert.deepEqual(array, [8, 7, 6, 5, 4, 3, 2, 1]);
-      },
-      "sorts a two-element heap in descending order": function(heap) {
-        var array = [1, 4],
-            n = array.length;
-        heap.sort(array, 0, n);
-        assert.deepEqual(array, [4, 1]);
-      }
-    }
-  }
-});
-
-suite.export(module);

data/vendor/assets/javascripts/tesseract/test/permute-test.js

@@ -1,51 +0,0 @@
-var vows = require("vows"),
-    assert = require("assert"),
-    tesseract = require("../");
-
-var suite = vows.describe("permute");
-
-suite.addBatch({
-  "permute": {
-    topic: function() {
-      return tesseract.permute;
-    },
-    "permutes according to the specified index": function(permute) {
-      assert.deepEqual(permute([3, 4, 5], [2, 1, 0]), [5, 4, 3]);
-      assert.deepEqual(permute([3, 4, 5], [2, 0, 1]), [5, 3, 4]);
-      assert.deepEqual(permute([3, 4, 5], [0, 1, 2]), [3, 4, 5]);
-    },
-    "does not modify the input array": function(permute) {
-      var input = [3, 4, 5];
-      permute(input, [2, 1, 0]);
-      assert.deepEqual(input, [3, 4, 5]);
-    },
-    "can duplicate input values": function(permute) {
-      assert.deepEqual(permute([3, 4, 5], [0, 1, 0]), [3, 4, 3]);
-      assert.deepEqual(permute([3, 4, 5], [2, 2, 2]), [5, 5, 5]);
-      assert.deepEqual(permute([3, 4, 5], [0, 1, 1]), [3, 4, 4]);
-    },
-    "can return more elements": function(permute) {
-      assert.deepEqual(permute([3, 4, 5], [0, 0, 1, 2]), [3, 3, 4, 5]);
-      assert.deepEqual(permute([3, 4, 5], [0, 1, 1, 1]), [3, 4, 4, 4]);
-    },
-    "can return fewer elements": function(permute) {
-      assert.deepEqual(permute([3, 4, 5], [0]), [3]);
-      assert.deepEqual(permute([3, 4, 5], [1, 2]), [4, 5]);
-      assert.deepEqual(permute([3, 4, 5], []), []);
-    },
-    "can return undefined elements": function(permute) {
-      var v1 = permute([3, 4, 5], [10]);
-      assert.equal(v1.length, 1);
-      assert.isUndefined(v1[0]);
-      var v2 = permute([3, 4, 5], [-1]);
-      assert.equal(v2.length, 1);
-      assert.isUndefined(v2[0]);
-      var v3 = permute([3, 4, 5], [0, -1]);
-      assert.equal(v3.length, 2);
-      assert.equal(v3[0], 3);
-      assert.isUndefined(v3[1]);
-    }
-  }
-});
-
-suite.export(module);