137 lines
3.7 KiB
JavaScript
137 lines
3.7 KiB
JavaScript
goog.provide('ol.test.structs.RBush');
|
|
|
|
|
|
describe('ol.structs.RBush', function() {
|
|
|
|
var rBush;
|
|
beforeEach(function() {
|
|
rBush = new ol.structs.RBush();
|
|
});
|
|
|
|
describe('when empty', function() {
|
|
|
|
describe('#all', function() {
|
|
|
|
it('returns the expected number of objects', function() {
|
|
expect(rBush.all()).to.be.empty();
|
|
});
|
|
|
|
});
|
|
|
|
});
|
|
|
|
describe('with a few objects', function() {
|
|
|
|
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);
|
|
});
|
|
|
|
});
|
|
|
|
});
|
|
|
|
});
|
|
|
|
goog.require('goog.object');
|
|
goog.require('ol.structs.RBush');
|