modules/actions/disconnect.js (96 lines of code) (raw):
import { osmNode } from '../osm/node';
// Disconnect the ways at the given node.
//
// Optionally, disconnect only the given ways.
//
// For testing convenience, accepts an ID to assign to the (first) new node.
// Normally, this will be undefined and the way will automatically
// be assigned a new ID.
//
// This is the inverse of `iD.actionConnect`.
//
// Reference:
// https://github.com/openstreetmap/potlatch2/blob/master/net/systemeD/halcyon/connection/actions/UnjoinNodeAction.as
// https://github.com/openstreetmap/josm/blob/mirror/src/org/openstreetmap/josm/actions/UnGlueAction.java
//
export function actionDisconnect(nodeId, newNodeId) {
var wayIds;
var action = function(graph) {
var node = graph.entity(nodeId);
var connections = action.connections(graph);
connections.forEach(function(connection) {
var way = graph.entity(connection.wayID);
var newNode = osmNode({id: newNodeId, loc: node.loc, tags: node.tags});
graph = graph.replace(newNode);
if (connection.index === 0 && way.isArea()) {
// replace shared node with shared node..
graph = graph.replace(way.replaceNode(way.nodes[0], newNode.id));
} else if (way.isClosed() && connection.index === way.nodes.length - 1) {
// replace closing node with new new node..
graph = graph.replace(way.unclose().addNode(newNode.id));
} else {
// replace shared node with multiple new nodes..
graph = graph.replace(way.updateNode(newNode.id, connection.index));
}
});
return graph;
};
action.connections = function(graph) {
var candidates = [];
var keeping = false;
var parentWays = graph.parentWays(graph.entity(nodeId));
var way, waynode;
for (var i = 0; i < parentWays.length; i++) {
way = parentWays[i];
if (wayIds && wayIds.indexOf(way.id) === -1) {
keeping = true;
continue;
}
if (way.isArea() && (way.nodes[0] === nodeId)) {
candidates.push({ wayID: way.id, index: 0 });
} else {
for (var j = 0; j < way.nodes.length; j++) {
waynode = way.nodes[j];
if (waynode === nodeId) {
if (way.isClosed() &&
parentWays.length > 1 &&
wayIds &&
wayIds.indexOf(way.id) !== -1 &&
j === way.nodes.length - 1) {
continue;
}
candidates.push({ wayID: way.id, index: j });
}
}
}
}
if (keeping) {
return candidates;
} else {
// if nodeId is positive, make sure a positive way retains it
if (nodeId[1] !== '-' && candidates.length > 1 &&
candidates[0].wayID[1] === '-') {
for (var pos = 1; pos < candidates.length; pos++) {
if (candidates[pos].wayID[1] !== '-') {
candidates.splice(pos, 1);
return candidates;
}
}
}
return candidates.slice(1);
}
};
action.disabled = function(graph) {
var connections = action.connections(graph);
if (connections.length === 0) return 'not_connected';
var parentWays = graph.parentWays(graph.entity(nodeId));
var seenRelationIds = {};
var sharedRelation;
parentWays.forEach(function(way) {
var relations = graph.parentRelations(way);
relations.forEach(function(relation) {
if (relation.id in seenRelationIds) {
if (wayIds) {
if (wayIds.indexOf(way.id) !== -1 ||
wayIds.indexOf(seenRelationIds[relation.id]) !== -1) {
sharedRelation = relation;
}
} else {
sharedRelation = relation;
}
} else {
seenRelationIds[relation.id] = way.id;
}
});
});
if (sharedRelation) return 'relation';
};
action.limitWays = function(val) {
if (!arguments.length) return wayIds;
wayIds = val;
return action;
};
return action;
}