ashatora/openlayers
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Refactor ol.structs.RBush tests

Browse Source
This commit is contained in:
Tom Payne
2013-11-25 17:21:24 +01:00
committed by Tim Schaub
parent a76eba34e8
commit 0ea7c2cd50
1 changed files with 110 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files

189
test/spec/ol/structs/rbush.js
View File

@@ -3,98 +3,129 @@ goog.provide('ol.test.structs.RBush');
describe('ol.structs.RBush', function() {
var rBush = new ol.structs.RBush();
describe('creation', function() {
it('can insert 1k objects', function() {
var i = 1000;
while (i > 0) {
var min = [Math.random() * 10000, Math.random() * 10000];
var max = [min[0] + Math.random() * 500, min[1] + Math.random() * 500];
var bounds = [min[0], min[1], max[0], max[1]];
rBush.insert(bounds, {id: i});
i--;
}
expect(rBush.allInExtent([0, 0, 10600, 10600]).length).to.be(1000);
});
it('can insert 1k more objects', function() {
var i = 1000;
while (i > 0) {
var min = [Math.random() * 10000, Math.random() * 10000];
var max = [min[0] + Math.random() * 500, min[1] + Math.random() * 500];
var bounds = [min[0], min[1], max[0], max[1]];
rBush.insert(bounds, {id: i});
i--;
}
expect(rBush.allInExtent([0, 0, 10600, 10600]).length).to.be(2000);
});
var rBush;
beforeEach(function() {
rBush = new ol.structs.RBush();
});
describe('search', function() {
it('can perform 1k out-of-bounds searches', function() {
var i = 1000;
var len = 0;
while (i > 0) {
var min = [-(Math.random() * 10000 + 501),
-(Math.random() * 10000 + 501)];
var max = [min[0] + Math.random() * 500, min[1] + Math.random() * 500];
var bounds = [min[0], min[1], max[0], max[1]];
len += rBush.allInExtent(bounds).length;
i--;
}
expect(len).to.be(0);
});
it('can perform 1k in-bounds searches', function() {
var i = 1000;
var len = 0;
while (i > 0) {
var min = [Math.random() * 10000, Math.random() * 10000];
var max = [min[0] + Math.random() * 500, min[1] + Math.random() * 500];
var bounds = [min[0], min[1], max[0], max[1]];
len += rBush.allInExtent(bounds).length;
i--;
}
expect(len).not.to.be(0);
describe('when empty', function() {
describe('#all', function() {
it('returns the expected number of objects', function() {
expect(rBush.all()).to.be.empty();
});
});
});
describe.skip('deletion', function() {
var len = 0;
it('can delete half the RBush', function() {
var bounds = [5000, 0, 10500, 10500];
len += rBush.remove(bounds).length;
expect(len).to.not.be(0);
});
it('can delete the other half of the RBush', function() {
var bounds = [0, 0, 5000, 10500];
len += rBush.remove(bounds).length;
expect(len).to.be(2000);
});
});
describe('with a few objects', function() {
describe('result plausibility and structure', function() {
it('filters by rectangle', function() {
var objs = [{}, {}, {}, {}, {}, {}];
var objs;
beforeEach(function() {
objs = [{}, {}, {}, {}, {}, {}];
rBush.insert([0, 0, 1, 1], objs[0]);
rBush.insert([1, 1, 4, 4], objs[1]);
rBush.insert([2, 2, 3, 3], objs[2]);
rBush.insert([-5, -5, -4, -4], objs[3]);
rBush.insert([-4, -4, -1, -1], objs[4]);
rBush.insert([-3, -3, -2, -2], objs[5]);
});
describe('#allInExtent', function() {
it('returns the expected objects', function() {
var result;
result = rBush.allInExtent([2, 2, 3, 3]);
expect(result).to.contain(objs[1]);
expect(result).to.contain(objs[2]);
expect(result.length).to.be(2);
result = rBush.allInExtent([-1, -1, 2, 2]);
expect(result).to.contain(objs[0]);
expect(result).to.contain(objs[1]);
expect(result).to.contain(objs[2]);
expect(result).to.contain(objs[4]);
expect(result.length).to.be(4);
});
it('returns an empty array when given a disjoint extent', function() {
expect(rBush.allInExtent([5, 5, 6, 6]).length).to.be(0);
});
});
});
describe('with 1000 objects', function() {
beforeEach(function() {
var i;
for (i = 0; i < 1000; ++i) {
var min = [Math.random() * 10000, Math.random() * 10000];
var max = [min[0] + Math.random() * 500, min[1] + Math.random() * 500];
var extent = [min[0], min[1], max[0], max[1]];
rBush.insert(extent, {id: i});
}
});
describe('#all', function() {
it('returns the expected number of objects', function() {
expect(rBush.all().length).to.be(1000);
});
});
describe('#allInExtent', function() {
it('returns the expected number of objects', function() {
expect(rBush.allInExtent([0, 0, 10600, 10600]).length).to.be(1000);
});
it('can perform 1000 in-extent searches', function() {
var n = 0;
var i;
for (i = 0; i < 1000; ++i) {
var min = [Math.random() * 10000, Math.random() * 10000];
var max = [min[0] + Math.random() * 500,
min[1] + Math.random() * 500];
var extent = [min[0], min[1], max[0], max[1]];
n += rBush.allInExtent(extent).length;
}
expect(n).not.to.be(0);
});
it('can perform 1000 out-of-extent searches', function() {
var n = 0;
var i;
for (i = 0; i < 1000; ++i) {
var min = [-(Math.random() * 10000 + 501),
-(Math.random() * 10000 + 501)];
var max = [min[0] + Math.random() * 500,
min[1] + Math.random() * 500];
var extent = [min[0], min[1], max[0], max[1]];
n += rBush.allInExtent(extent).length;
}
expect(n).to.be(0);
});
});
describe('#insert', function() {
it('can insert another 1000 objects', function() {
var i;
for (i = 1000; i < 2000; ++i) {
var min = [Math.random() * 10000, Math.random() * 10000];
var max = [min[0] + Math.random() * 500,
min[1] + Math.random() * 500];
var extent = [min[0], min[1], max[0], max[1]];
rBush.insert(extent, {id: i});
}
expect(rBush.allInExtent([0, 0, 10600, 10600]).length).to.be(2000);
});
var result;
result = rBush.allInExtent([2, 2, 3, 3]);
expect(result).to.contain(objs[1]);
expect(result).to.contain(objs[2]);
expect(result.length).to.be(2);
result = rBush.allInExtent([-1, -1, 2, 2]);
expect(result).to.contain(objs[0]);
expect(result).to.contain(objs[1]);
expect(result).to.contain(objs[2]);
expect(result).to.contain(objs[4]);
expect(result.length).to.be(4);
expect(rBush.allInExtent([5, 5, 6, 6]).length).to.be(0);
});
});