mirror of
https://github.com/FoggedLens/iD.git
synced 2026-02-13 17:23:02 +00:00
Previously, entities that already existed in the rtree prior to the rebase option would end up duplicated in the tree afterward. Fixes #2637
100 lines
2.7 KiB
JavaScript
100 lines
2.7 KiB
JavaScript
iD.Tree = function(head) {
|
|
var rtree = rbush(),
|
|
rectangles = {};
|
|
|
|
function extentRectangle(extent) {
|
|
return [
|
|
extent[0][0],
|
|
extent[0][1],
|
|
extent[1][0],
|
|
extent[1][1]
|
|
];
|
|
}
|
|
|
|
function entityRectangle(entity) {
|
|
var rect = extentRectangle(entity.extent(head));
|
|
rect.id = entity.id;
|
|
rectangles[entity.id] = rect;
|
|
return rect;
|
|
}
|
|
|
|
function updateParents(entity, insertions, memo) {
|
|
head.parentWays(entity).forEach(function(parent) {
|
|
if (rectangles[parent.id]) {
|
|
rtree.remove(rectangles[parent.id]);
|
|
insertions[parent.id] = parent;
|
|
}
|
|
});
|
|
|
|
head.parentRelations(entity).forEach(function(parent) {
|
|
if (memo[entity.id]) return;
|
|
memo[entity.id] = true;
|
|
if (rectangles[parent.id]) {
|
|
rtree.remove(rectangles[parent.id]);
|
|
insertions[parent.id] = parent;
|
|
}
|
|
updateParents(parent, insertions, memo);
|
|
});
|
|
}
|
|
|
|
var tree = {};
|
|
|
|
tree.rebase = function(entities, force) {
|
|
var insertions = {};
|
|
|
|
for (var i = 0; i < entities.length; i++) {
|
|
var entity = entities[i];
|
|
|
|
if (!entity.visible)
|
|
continue;
|
|
|
|
if (head.entities.hasOwnProperty(entity.id) || rectangles[entity.id]) {
|
|
if (!force) {
|
|
continue;
|
|
} else if (rectangles[entity.id]) {
|
|
rtree.remove(rectangles[entity.id]);
|
|
}
|
|
}
|
|
|
|
insertions[entity.id] = entity;
|
|
updateParents(entity, insertions, {});
|
|
}
|
|
|
|
rtree.load(_.map(insertions, entityRectangle));
|
|
|
|
return tree;
|
|
};
|
|
|
|
tree.intersects = function(extent, graph) {
|
|
if (graph !== head) {
|
|
var diff = iD.Difference(head, graph),
|
|
insertions = {};
|
|
|
|
head = graph;
|
|
|
|
diff.deleted().forEach(function(entity) {
|
|
rtree.remove(rectangles[entity.id]);
|
|
delete rectangles[entity.id];
|
|
});
|
|
|
|
diff.modified().forEach(function(entity) {
|
|
rtree.remove(rectangles[entity.id]);
|
|
insertions[entity.id] = entity;
|
|
updateParents(entity, insertions, {});
|
|
});
|
|
|
|
diff.created().forEach(function(entity) {
|
|
insertions[entity.id] = entity;
|
|
});
|
|
|
|
rtree.load(_.map(insertions, entityRectangle));
|
|
}
|
|
|
|
return rtree.search(extentRectangle(extent)).map(function(rect) {
|
|
return head.entity(rect.id);
|
|
});
|
|
};
|
|
|
|
return tree;
|
|
};
|