265 строки
9.6 KiB
JavaScript
265 строки
9.6 KiB
JavaScript
require("../env");
|
|
|
|
var vows = require("vows"),
|
|
assert = require("assert");
|
|
|
|
var suite = vows.describe("d3.bisect");
|
|
|
|
var i30 = 1 << 30;
|
|
|
|
suite.addBatch({
|
|
"bisectLeft": {
|
|
topic: function() {
|
|
return d3.bisectLeft;
|
|
},
|
|
"finds the index of an exact match": function(bisect) {
|
|
var array = [1, 2, 3];
|
|
assert.equal(bisect(array, 1), 0);
|
|
assert.equal(bisect(array, 2), 1);
|
|
assert.equal(bisect(array, 3), 2);
|
|
},
|
|
"finds the index of the first match": function(bisect) {
|
|
var array = [1, 2, 2, 3];
|
|
assert.equal(bisect(array, 1), 0);
|
|
assert.equal(bisect(array, 2), 1);
|
|
assert.equal(bisect(array, 3), 3);
|
|
},
|
|
"finds the insertion point of a non-exact match": function(bisect) {
|
|
var array = [1, 2, 3];
|
|
assert.equal(bisect(array, 0.5), 0);
|
|
assert.equal(bisect(array, 1.5), 1);
|
|
assert.equal(bisect(array, 2.5), 2);
|
|
assert.equal(bisect(array, 3.5), 3);
|
|
},
|
|
"observes the optional lower bound": function(bisect) {
|
|
var array = [1, 2, 3, 4, 5];
|
|
assert.equal(bisect(array, 0, 2), 2);
|
|
assert.equal(bisect(array, 1, 2), 2);
|
|
assert.equal(bisect(array, 2, 2), 2);
|
|
assert.equal(bisect(array, 3, 2), 2);
|
|
assert.equal(bisect(array, 4, 2), 3);
|
|
assert.equal(bisect(array, 5, 2), 4);
|
|
assert.equal(bisect(array, 6, 2), 5);
|
|
},
|
|
"observes the optional 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);
|
|
},
|
|
"large arrays": function(bisect) {
|
|
var array = [],
|
|
i = i30;
|
|
array[i++] = 1;
|
|
array[i++] = 2;
|
|
array[i++] = 3;
|
|
array[i++] = 4;
|
|
array[i++] = 5;
|
|
assert.equal(bisect(array, 0, i - 5, i), i - 5);
|
|
assert.equal(bisect(array, 1, i - 5, i), i - 5);
|
|
assert.equal(bisect(array, 2, i - 5, i), i - 4);
|
|
assert.equal(bisect(array, 3, i - 5, i), i - 3);
|
|
assert.equal(bisect(array, 4, i - 5, i), i - 2);
|
|
assert.equal(bisect(array, 5, i - 5, i), i - 1);
|
|
assert.equal(bisect(array, 6, i - 5, i), i - 0);
|
|
}
|
|
}
|
|
});
|
|
|
|
suite.addBatch({
|
|
"bisectRight": {
|
|
topic: function() {
|
|
return d3.bisectRight;
|
|
},
|
|
"finds the index after an exact match": function(bisect) {
|
|
var array = [1, 2, 3];
|
|
assert.equal(bisect(array, 1), 1);
|
|
assert.equal(bisect(array, 2), 2);
|
|
assert.equal(bisect(array, 3), 3);
|
|
},
|
|
"finds the index after the last match": function(bisect) {
|
|
var array = [1, 2, 2, 3];
|
|
assert.equal(bisect(array, 1), 1);
|
|
assert.equal(bisect(array, 2), 3);
|
|
assert.equal(bisect(array, 3), 4);
|
|
},
|
|
"finds the insertion point of a non-exact match": function(bisect) {
|
|
var array = [1, 2, 3];
|
|
assert.equal(bisect(array, 0.5), 0);
|
|
assert.equal(bisect(array, 1.5), 1);
|
|
assert.equal(bisect(array, 2.5), 2);
|
|
assert.equal(bisect(array, 3.5), 3);
|
|
},
|
|
"observes the optional lower bound": function(bisect) {
|
|
var array = [1, 2, 3, 4, 5];
|
|
assert.equal(bisect(array, 0, 2), 2);
|
|
assert.equal(bisect(array, 1, 2), 2);
|
|
assert.equal(bisect(array, 2, 2), 2);
|
|
assert.equal(bisect(array, 3, 2), 3);
|
|
assert.equal(bisect(array, 4, 2), 4);
|
|
assert.equal(bisect(array, 5, 2), 5);
|
|
assert.equal(bisect(array, 6, 2), 5);
|
|
},
|
|
"observes the optional 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);
|
|
},
|
|
"large arrays": function(bisect) {
|
|
var array = [],
|
|
i = i30;
|
|
array[i++] = 1;
|
|
array[i++] = 2;
|
|
array[i++] = 3;
|
|
array[i++] = 4;
|
|
array[i++] = 5;
|
|
assert.equal(bisect(array, 0, i - 5, i), i - 5);
|
|
assert.equal(bisect(array, 1, i - 5, i), i - 4);
|
|
assert.equal(bisect(array, 2, i - 5, i), i - 3);
|
|
assert.equal(bisect(array, 3, i - 5, i), i - 2);
|
|
assert.equal(bisect(array, 4, i - 5, i), i - 1);
|
|
assert.equal(bisect(array, 5, i - 5, i), i - 0);
|
|
assert.equal(bisect(array, 6, i - 5, i), i - 0);
|
|
}
|
|
}
|
|
});
|
|
|
|
suite.addBatch({
|
|
"bisector(key)": {
|
|
topic: function() {
|
|
return d3.bisector(function(d) { return d.key; });
|
|
},
|
|
"left": {
|
|
topic: function(bisector) {
|
|
return bisector.left;
|
|
},
|
|
"finds the index of an exact match": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 3}];
|
|
assert.equal(bisect(array, 1), 0);
|
|
assert.equal(bisect(array, 2), 1);
|
|
assert.equal(bisect(array, 3), 2);
|
|
},
|
|
"finds the index of the first match": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 2}, {key: 3}];
|
|
assert.equal(bisect(array, 1), 0);
|
|
assert.equal(bisect(array, 2), 1);
|
|
assert.equal(bisect(array, 3), 3);
|
|
},
|
|
"finds the insertion point of a non-exact match": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 3}];
|
|
assert.equal(bisect(array, 0.5), 0);
|
|
assert.equal(bisect(array, 1.5), 1);
|
|
assert.equal(bisect(array, 2.5), 2);
|
|
assert.equal(bisect(array, 3.5), 3);
|
|
},
|
|
"observes the optional lower bound": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 3}, {key: 4}, {key: 5}];
|
|
assert.equal(bisect(array, 0, 2), 2);
|
|
assert.equal(bisect(array, 1, 2), 2);
|
|
assert.equal(bisect(array, 2, 2), 2);
|
|
assert.equal(bisect(array, 3, 2), 2);
|
|
assert.equal(bisect(array, 4, 2), 3);
|
|
assert.equal(bisect(array, 5, 2), 4);
|
|
assert.equal(bisect(array, 6, 2), 5);
|
|
},
|
|
"observes the optional bounds": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 3}, {key: 4}, {key: 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);
|
|
},
|
|
"large arrays": function(bisect) {
|
|
var array = [],
|
|
i = i30;
|
|
array[i++] = {key: 1};
|
|
array[i++] = {key: 2};
|
|
array[i++] = {key: 3};
|
|
array[i++] = {key: 4};
|
|
array[i++] = {key: 5};
|
|
assert.equal(bisect(array, 0, i - 5, i), i - 5);
|
|
assert.equal(bisect(array, 1, i - 5, i), i - 5);
|
|
assert.equal(bisect(array, 2, i - 5, i), i - 4);
|
|
assert.equal(bisect(array, 3, i - 5, i), i - 3);
|
|
assert.equal(bisect(array, 4, i - 5, i), i - 2);
|
|
assert.equal(bisect(array, 5, i - 5, i), i - 1);
|
|
assert.equal(bisect(array, 6, i - 5, i), i - 0);
|
|
}
|
|
},
|
|
"right": {
|
|
topic: function(bisector) {
|
|
return bisector.right;
|
|
},
|
|
"finds the index after an exact match": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 3}];
|
|
assert.equal(bisect(array, 1), 1);
|
|
assert.equal(bisect(array, 2), 2);
|
|
assert.equal(bisect(array, 3), 3);
|
|
},
|
|
"finds the index after the last match": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 2}, {key: 3}];
|
|
assert.equal(bisect(array, 1), 1);
|
|
assert.equal(bisect(array, 2), 3);
|
|
assert.equal(bisect(array, 3), 4);
|
|
},
|
|
"finds the insertion point of a non-exact match": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 3}];
|
|
assert.equal(bisect(array, 0.5), 0);
|
|
assert.equal(bisect(array, 1.5), 1);
|
|
assert.equal(bisect(array, 2.5), 2);
|
|
assert.equal(bisect(array, 3.5), 3);
|
|
},
|
|
"observes the optional lower bound": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 3}, {key: 4}, {key: 5}];
|
|
assert.equal(bisect(array, 0, 2), 2);
|
|
assert.equal(bisect(array, 1, 2), 2);
|
|
assert.equal(bisect(array, 2, 2), 2);
|
|
assert.equal(bisect(array, 3, 2), 3);
|
|
assert.equal(bisect(array, 4, 2), 4);
|
|
assert.equal(bisect(array, 5, 2), 5);
|
|
assert.equal(bisect(array, 6, 2), 5);
|
|
},
|
|
"observes the optional bounds": function(bisect) {
|
|
var array = [{key: 1}, {key: 2}, {key: 3}, {key: 4}, {key: 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);
|
|
},
|
|
"large arrays": function(bisect) {
|
|
var array = [],
|
|
i = i30;
|
|
array[i++] = {key: 1};
|
|
array[i++] = {key: 2};
|
|
array[i++] = {key: 3};
|
|
array[i++] = {key: 4};
|
|
array[i++] = {key: 5};
|
|
assert.equal(bisect(array, 0, i - 5, i), i - 5);
|
|
assert.equal(bisect(array, 1, i - 5, i), i - 4);
|
|
assert.equal(bisect(array, 2, i - 5, i), i - 3);
|
|
assert.equal(bisect(array, 3, i - 5, i), i - 2);
|
|
assert.equal(bisect(array, 4, i - 5, i), i - 1);
|
|
assert.equal(bisect(array, 5, i - 5, i), i - 0);
|
|
assert.equal(bisect(array, 6, i - 5, i), i - 0);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
suite.export(module);
|