1 | // License: GPL. For details, see LICENSE file.
|
---|
2 | package org.openstreetmap.josm.gui.dialogs.relation.sort;
|
---|
3 |
|
---|
4 | import static org.openstreetmap.josm.gui.dialogs.relation.sort.WayConnectionType.Direction.BACKWARD;
|
---|
5 | import static org.openstreetmap.josm.gui.dialogs.relation.sort.WayConnectionType.Direction.FORWARD;
|
---|
6 | import static org.openstreetmap.josm.gui.dialogs.relation.sort.WayConnectionType.Direction.NONE;
|
---|
7 |
|
---|
8 | import java.util.ArrayList;
|
---|
9 | import java.util.List;
|
---|
10 | import java.util.stream.Collectors;
|
---|
11 |
|
---|
12 | import org.openstreetmap.josm.data.osm.Node;
|
---|
13 | import org.openstreetmap.josm.data.osm.Relation;
|
---|
14 | import org.openstreetmap.josm.data.osm.RelationMember;
|
---|
15 | import org.openstreetmap.josm.data.osm.Way;
|
---|
16 | import org.openstreetmap.josm.gui.dialogs.relation.sort.WayConnectionType.Direction;
|
---|
17 | import org.openstreetmap.josm.tools.StreamUtils;
|
---|
18 | import org.openstreetmap.josm.tools.bugreport.BugReport;
|
---|
19 |
|
---|
20 | /**
|
---|
21 | * This class calculates the {@link WayConnectionType} for a given list of members
|
---|
22 | */
|
---|
23 | public class WayConnectionTypeCalculator {
|
---|
24 |
|
---|
25 | private static final int UNCONNECTED = Integer.MIN_VALUE;
|
---|
26 |
|
---|
27 | private List<RelationMember> members;
|
---|
28 |
|
---|
29 | /**
|
---|
30 | * refresh the cache of member WayConnectionTypes
|
---|
31 | * @param members relation members
|
---|
32 | * @return way connections
|
---|
33 | */
|
---|
34 | public List<WayConnectionType> updateLinks(List<RelationMember> members) {
|
---|
35 | return updateLinks(null, members);
|
---|
36 | }
|
---|
37 |
|
---|
38 | /**
|
---|
39 | * refresh the cache of member WayConnectionTypes
|
---|
40 | * @param r relation. Can be null, for plugins compatibility, but really shouldn't
|
---|
41 | * @param members relation members
|
---|
42 | * @return way connections
|
---|
43 | * @since 15696
|
---|
44 | */
|
---|
45 | public List<WayConnectionType> updateLinks(Relation r, List<RelationMember> members) {
|
---|
46 | this.members = members;
|
---|
47 | final List<WayConnectionType> con = members.stream()
|
---|
48 | .map(ignore -> (WayConnectionType) null)
|
---|
49 | .collect(Collectors.toList());
|
---|
50 |
|
---|
51 | firstGroupIdx = 0;
|
---|
52 |
|
---|
53 | lastForwardWay = UNCONNECTED;
|
---|
54 | lastBackwardWay = UNCONNECTED;
|
---|
55 | onewayBeginning = false;
|
---|
56 | WayConnectionType lastWct = null;
|
---|
57 |
|
---|
58 | for (int i = 0; i < members.size(); ++i) {
|
---|
59 | try {
|
---|
60 | lastWct = updateLinksFor(r, con, lastWct, i);
|
---|
61 | } catch (RuntimeException e) {
|
---|
62 | int index = i;
|
---|
63 | throw BugReport.intercept(e).put("i", i).put("member", () -> members.get(index)).put("con", con)
|
---|
64 | .put("members", members).put("lastWct", lastWct).put("firstGroupIdx", firstGroupIdx);
|
---|
65 | }
|
---|
66 | }
|
---|
67 | if (!isSuperRoute(r)) {
|
---|
68 | makeLoopIfNeeded(con, members.size() - 1);
|
---|
69 | }
|
---|
70 |
|
---|
71 | return con;
|
---|
72 | }
|
---|
73 |
|
---|
74 | private WayConnectionType updateLinksFor(Relation r, List<WayConnectionType> con, WayConnectionType lastWct, int i) {
|
---|
75 | final RelationMember m = members.get(i);
|
---|
76 | if (isSuperRoute(r)) {
|
---|
77 | final WayConnectionType wct;
|
---|
78 | if (i == 0) {
|
---|
79 | wct = new WayConnectionType(false);
|
---|
80 | } else if (!members.get(i).isRelation() || !members.get(i - 1).isRelation()) {
|
---|
81 | wct = new WayConnectionType(true);
|
---|
82 | } else {
|
---|
83 | final List<RelationMember> previousMembers = members.get(i - 1).getRelation().getMembers();
|
---|
84 | final Way previousLastWay = StreamUtils.reversedStream(previousMembers)
|
---|
85 | .filter(x -> x.isWay() && !x.hasRole())
|
---|
86 | .map(RelationMember::getWay)
|
---|
87 | .findFirst().orElse(null);
|
---|
88 | final Way currentFirstWay = m.getRelation().getMembers().stream()
|
---|
89 | .filter(x -> x.isWay() && !x.hasRole())
|
---|
90 | .map(RelationMember::getWay)
|
---|
91 | .findFirst().orElse(null);
|
---|
92 | final boolean isConnected = isConnected(previousLastWay, currentFirstWay);
|
---|
93 | wct = new WayConnectionType(false);
|
---|
94 | lastWct.linkNext = wct.linkPrev = isConnected;
|
---|
95 | }
|
---|
96 | con.set(i, wct);
|
---|
97 | return wct;
|
---|
98 | } else if (isNoHandleableWay(m)) {
|
---|
99 | if (i > 0) {
|
---|
100 | makeLoopIfNeeded(con, i-1);
|
---|
101 | }
|
---|
102 | con.set(i, new WayConnectionType());
|
---|
103 | firstGroupIdx = i;
|
---|
104 | } else {
|
---|
105 | WayConnectionType wct = computeNextWayConnection(r, con, lastWct, i, m);
|
---|
106 |
|
---|
107 | if (!wct.linkPrev) {
|
---|
108 | if (i > 0) {
|
---|
109 | makeLoopIfNeeded(con, i-1);
|
---|
110 | }
|
---|
111 | firstGroupIdx = i;
|
---|
112 | }
|
---|
113 | return wct;
|
---|
114 | }
|
---|
115 | return lastWct;
|
---|
116 | }
|
---|
117 |
|
---|
118 | private static boolean isNoHandleableWay(final RelationMember m) {
|
---|
119 | return !m.isWay() || m.getWay() == null || m.getWay().isIncomplete();
|
---|
120 | }
|
---|
121 |
|
---|
122 | private WayConnectionType computeNextWayConnection(Relation r, List<WayConnectionType> con, WayConnectionType lastWct, int i,
|
---|
123 | final RelationMember m) {
|
---|
124 | WayConnectionType wct = new WayConnectionType(false);
|
---|
125 | wct.linkPrev = i > 0 && con.get(i-1) != null && con.get(i-1).isValid();
|
---|
126 | wct.direction = NONE;
|
---|
127 | wct.ignoreOneway = isOnewayIgnored(r);
|
---|
128 |
|
---|
129 | if (!wct.ignoreOneway && RelationSortUtils.isOneway(m)) {
|
---|
130 | handleOneway(lastWct, i, wct);
|
---|
131 | }
|
---|
132 |
|
---|
133 | if (wct.linkPrev) {
|
---|
134 | if (lastBackwardWay != UNCONNECTED && lastForwardWay != UNCONNECTED) {
|
---|
135 | determineOnewayConnectionType(con, m, i, wct);
|
---|
136 | if (!wct.linkPrev) {
|
---|
137 | firstGroupIdx = i;
|
---|
138 | }
|
---|
139 | }
|
---|
140 |
|
---|
141 | if (lastWct != null && !RelationSortUtils.isOneway(m)) {
|
---|
142 | wct.direction = determineDirection(i-1, lastWct.direction, i);
|
---|
143 | wct.linkPrev = wct.direction != NONE;
|
---|
144 | }
|
---|
145 | }
|
---|
146 |
|
---|
147 | if (!wct.linkPrev) {
|
---|
148 | wct.direction = determineDirectionOfFirst(i, m);
|
---|
149 | if (RelationSortUtils.isOneway(m)) {
|
---|
150 | wct.isOnewayLoopForwardPart = true;
|
---|
151 | lastForwardWay = i;
|
---|
152 | }
|
---|
153 | }
|
---|
154 |
|
---|
155 | wct.linkNext = false;
|
---|
156 | if (lastWct != null) {
|
---|
157 | lastWct.linkNext = wct.linkPrev;
|
---|
158 | }
|
---|
159 |
|
---|
160 | if (!wct.ignoreOneway) {
|
---|
161 | handleOnewayFollows(lastWct, i, m, wct);
|
---|
162 | }
|
---|
163 | con.set(i, wct);
|
---|
164 | return wct;
|
---|
165 | }
|
---|
166 |
|
---|
167 | private boolean isSuperRoute(Relation r) {
|
---|
168 | return r != null && r.hasTag("type", "superroute");
|
---|
169 | }
|
---|
170 |
|
---|
171 | private static boolean isOnewayIgnored(Relation r) {
|
---|
172 | return r != null && r.hasTag("type", "boundary", "multipolygon");
|
---|
173 | }
|
---|
174 |
|
---|
175 | protected void handleOnewayFollows(WayConnectionType lastWct, int i, final RelationMember m,
|
---|
176 | WayConnectionType wct) {
|
---|
177 | if (lastWct != null && i > 0 && m.getMember() instanceof Way && members.get(i - 1).getMember() instanceof Way
|
---|
178 | && (m.getWay().isOneway() != 0 || members.get(i - 1).getWay().isOneway() != 0)) {
|
---|
179 | Way way = m.getWay();
|
---|
180 | Way previousWay = members.get(i - 1).getWay();
|
---|
181 | if (way.isOneway() != 0 && previousWay.isOneway() != 0 &&
|
---|
182 | (way.firstNode(true) != previousWay.lastNode(true) &&
|
---|
183 | way.lastNode(true) != previousWay.firstNode(true))) {
|
---|
184 | wct.onewayFollowsPrevious = false;
|
---|
185 | lastWct.onewayFollowsNext = false;
|
---|
186 | } else if (way.isOneway() != 0 && previousWay.isOneway() == 0 &&
|
---|
187 | previousWay.isFirstLastNode(way.lastNode(true))) {
|
---|
188 | wct.onewayFollowsPrevious = false;
|
---|
189 | }
|
---|
190 | }
|
---|
191 | }
|
---|
192 |
|
---|
193 | private void handleOneway(WayConnectionType lastWct, int i, WayConnectionType wct) {
|
---|
194 | if (lastWct != null && lastWct.isOnewayTail) {
|
---|
195 | wct.isOnewayHead = true;
|
---|
196 | }
|
---|
197 | if (lastBackwardWay == UNCONNECTED && lastForwardWay == UNCONNECTED) { //Beginning of new oneway
|
---|
198 | wct.isOnewayHead = true;
|
---|
199 | lastForwardWay = i-1;
|
---|
200 | lastBackwardWay = i-1;
|
---|
201 | onewayBeginning = true;
|
---|
202 | }
|
---|
203 | }
|
---|
204 |
|
---|
205 | private int firstGroupIdx;
|
---|
206 | private void makeLoopIfNeeded(final List<WayConnectionType> con, final int i) {
|
---|
207 | boolean loop = false;
|
---|
208 | if (i == firstGroupIdx) { //is primitive loop
|
---|
209 | loop = determineDirection(i, FORWARD, i) == FORWARD;
|
---|
210 | } else if (i >= 0) {
|
---|
211 | loop = determineDirection(i, con.get(i).direction, firstGroupIdx) == con.get(firstGroupIdx).direction;
|
---|
212 | }
|
---|
213 | if (loop) {
|
---|
214 | for (int j = firstGroupIdx; j <= i; ++j) {
|
---|
215 | con.get(j).isLoop = true;
|
---|
216 | }
|
---|
217 | }
|
---|
218 | }
|
---|
219 |
|
---|
220 | private Direction determineDirectionOfFirst(final int i, final RelationMember m) {
|
---|
221 | Direction result = RelationSortUtils.roundaboutType(m);
|
---|
222 | if (result != NONE)
|
---|
223 | return result;
|
---|
224 |
|
---|
225 | if (RelationSortUtils.isOneway(m)) {
|
---|
226 | if (RelationSortUtils.isBackward(m)) return BACKWARD;
|
---|
227 | else return FORWARD;
|
---|
228 | } else { /** guess the direction and see if it fits with the next member */
|
---|
229 | if (determineDirection(i, FORWARD, i+1) != NONE) return FORWARD;
|
---|
230 | if (determineDirection(i, BACKWARD, i+1) != NONE) return BACKWARD;
|
---|
231 | }
|
---|
232 | return NONE;
|
---|
233 | }
|
---|
234 |
|
---|
235 | private int lastForwardWay;
|
---|
236 | private int lastBackwardWay;
|
---|
237 | private boolean onewayBeginning;
|
---|
238 |
|
---|
239 | private void determineOnewayConnectionType(final List<WayConnectionType> con,
|
---|
240 | RelationMember m, int i, final WayConnectionType wct) {
|
---|
241 | Direction dirFW = determineDirection(lastForwardWay, con.get(lastForwardWay).direction, i);
|
---|
242 | Direction dirBW;
|
---|
243 | if (onewayBeginning) {
|
---|
244 | if (lastBackwardWay < 0) {
|
---|
245 | dirBW = determineDirection(firstGroupIdx, reverse(con.get(firstGroupIdx).direction), i, true);
|
---|
246 | } else {
|
---|
247 | dirBW = determineDirection(lastBackwardWay, con.get(lastBackwardWay).direction, i, true);
|
---|
248 | }
|
---|
249 |
|
---|
250 | if (dirBW != NONE) {
|
---|
251 | onewayBeginning = false;
|
---|
252 | }
|
---|
253 | } else {
|
---|
254 | dirBW = determineDirection(lastBackwardWay, con.get(lastBackwardWay).direction, i, true);
|
---|
255 | }
|
---|
256 |
|
---|
257 | if (RelationSortUtils.isOneway(m)) {
|
---|
258 | if (dirBW != NONE) {
|
---|
259 | wct.direction = dirBW;
|
---|
260 | lastBackwardWay = i;
|
---|
261 | wct.isOnewayLoopBackwardPart = true;
|
---|
262 | }
|
---|
263 | if (dirFW != NONE) {
|
---|
264 | wct.direction = dirFW;
|
---|
265 | lastForwardWay = i;
|
---|
266 | wct.isOnewayLoopForwardPart = true;
|
---|
267 | }
|
---|
268 | // Not connected to previous
|
---|
269 | if (dirFW == NONE && dirBW == NONE) {
|
---|
270 | wct.linkPrev = false;
|
---|
271 | if (RelationSortUtils.isOneway(m)) {
|
---|
272 | wct.isOnewayHead = true;
|
---|
273 | lastForwardWay = i-1;
|
---|
274 | lastBackwardWay = i-1;
|
---|
275 | } else {
|
---|
276 | lastForwardWay = UNCONNECTED;
|
---|
277 | lastBackwardWay = UNCONNECTED;
|
---|
278 | }
|
---|
279 | onewayBeginning = true;
|
---|
280 | }
|
---|
281 |
|
---|
282 | if (dirFW != NONE && dirBW != NONE) { //End of oneway loop
|
---|
283 | if (i+1 < members.size() && determineDirection(i, dirFW, i+1) != NONE) {
|
---|
284 | wct.isOnewayLoopBackwardPart = false;
|
---|
285 | wct.direction = dirFW;
|
---|
286 | } else {
|
---|
287 | wct.isOnewayLoopForwardPart = false;
|
---|
288 | wct.direction = dirBW;
|
---|
289 | }
|
---|
290 |
|
---|
291 | wct.isOnewayTail = true;
|
---|
292 | }
|
---|
293 |
|
---|
294 | } else {
|
---|
295 | lastForwardWay = UNCONNECTED;
|
---|
296 | lastBackwardWay = UNCONNECTED;
|
---|
297 | if (dirFW == NONE || dirBW == NONE) {
|
---|
298 | wct.linkPrev = false;
|
---|
299 | }
|
---|
300 | }
|
---|
301 | }
|
---|
302 |
|
---|
303 | private static Direction reverse(final Direction dir) {
|
---|
304 | if (dir == FORWARD) return BACKWARD;
|
---|
305 | if (dir == BACKWARD) return FORWARD;
|
---|
306 | return dir;
|
---|
307 | }
|
---|
308 |
|
---|
309 | private Direction determineDirection(int refI, Direction refDirection, int k) {
|
---|
310 | return determineDirection(refI, refDirection, k, false);
|
---|
311 | }
|
---|
312 |
|
---|
313 | /**
|
---|
314 | * Determines the direction of way {@code k} with respect to the way {@code ref_i}.
|
---|
315 | * The way {@code ref_i} is assumed to have the direction {@code ref_direction} and to be the predecessor of {@code k}.
|
---|
316 | *
|
---|
317 | * If both ways are not linked in any way, NONE is returned.
|
---|
318 | *
|
---|
319 | * Else the direction is given as follows:
|
---|
320 | * Let the relation be a route of oneway streets, and someone travels them in the given order.
|
---|
321 | * Direction is FORWARD if it is legal and BACKWARD if it is illegal to do so for the given way.
|
---|
322 | * @param refI way key
|
---|
323 | * @param refDirection direction of ref_i
|
---|
324 | * @param k successor of ref_i
|
---|
325 | * @param reversed if {@code true} determine reverse direction
|
---|
326 | * @return direction of way {@code k}
|
---|
327 | */
|
---|
328 | private Direction determineDirection(int refI, final Direction refDirection, int k, boolean reversed) {
|
---|
329 | if (members == null || refI < 0 || k < 0 || refI >= members.size() || k >= members.size() || refDirection == NONE)
|
---|
330 | return NONE;
|
---|
331 |
|
---|
332 | final RelationMember mRef = members.get(refI);
|
---|
333 | final RelationMember m = members.get(k);
|
---|
334 | Way wayRef = null;
|
---|
335 | Way way = null;
|
---|
336 |
|
---|
337 | if (mRef.isWay()) {
|
---|
338 | wayRef = mRef.getWay();
|
---|
339 | }
|
---|
340 | if (m.isWay()) {
|
---|
341 | way = m.getWay();
|
---|
342 | }
|
---|
343 |
|
---|
344 | if (wayRef == null || way == null)
|
---|
345 | return NONE;
|
---|
346 |
|
---|
347 | /** the list of nodes the way k can dock to */
|
---|
348 | List<Node> refNodes = new ArrayList<>();
|
---|
349 |
|
---|
350 | switch (refDirection) {
|
---|
351 | case FORWARD:
|
---|
352 | refNodes.add(wayRef.lastNode());
|
---|
353 | break;
|
---|
354 | case BACKWARD:
|
---|
355 | refNodes.add(wayRef.firstNode());
|
---|
356 | break;
|
---|
357 | case ROUNDABOUT_LEFT:
|
---|
358 | case ROUNDABOUT_RIGHT:
|
---|
359 | refNodes = wayRef.getNodes();
|
---|
360 | break;
|
---|
361 | default: // Do nothing
|
---|
362 | }
|
---|
363 |
|
---|
364 | for (Node n : refNodes) {
|
---|
365 | if (n == null) {
|
---|
366 | continue;
|
---|
367 | }
|
---|
368 | if (RelationSortUtils.roundaboutType(members.get(k)) != NONE) {
|
---|
369 | for (Node nn : way.getNodes()) {
|
---|
370 | if (n == nn)
|
---|
371 | return RelationSortUtils.roundaboutType(members.get(k));
|
---|
372 | }
|
---|
373 | } else if (RelationSortUtils.isOneway(m)) {
|
---|
374 | if (n == RelationNodeMap.firstOnewayNode(m) && !reversed) {
|
---|
375 | if (RelationSortUtils.isBackward(m))
|
---|
376 | return BACKWARD;
|
---|
377 | else
|
---|
378 | return FORWARD;
|
---|
379 | }
|
---|
380 | if (reversed && n == RelationNodeMap.lastOnewayNode(m)) {
|
---|
381 | if (RelationSortUtils.isBackward(m))
|
---|
382 | return FORWARD;
|
---|
383 | else
|
---|
384 | return BACKWARD;
|
---|
385 | }
|
---|
386 | } else {
|
---|
387 | if (n == way.firstNode())
|
---|
388 | return FORWARD;
|
---|
389 | if (n == way.lastNode())
|
---|
390 | return BACKWARD;
|
---|
391 | }
|
---|
392 | }
|
---|
393 | return NONE;
|
---|
394 | }
|
---|
395 |
|
---|
396 | /**
|
---|
397 | * Free resources.
|
---|
398 | */
|
---|
399 | public void clear() {
|
---|
400 | members = null;
|
---|
401 | }
|
---|
402 |
|
---|
403 | private boolean isConnected(Way way1, Way way2) {
|
---|
404 | return way1 != null && way2 != null && way1.isUsable() && way2.isUsable()
|
---|
405 | && (way1.isFirstLastNode(way2.firstNode()) || way1.isFirstLastNode(way2.lastNode()));
|
---|
406 | }
|
---|
407 | }
|
---|