source: josm/trunk/src/org/openstreetmap/josm/gui/dialogs/relation/MemberTableModel.java@ 5603

Last change on this file since 5603 was 5603, checked in by Don-vip, 11 years ago

fix #8224 - Relation sorting: run custom sorters before default one in order to take into account all primitives based on their role before their type -> this allows to sort associatedStreet houses if the addr:housenumber is set on a closed way instead of a node
  • Property svn:eol-style set to native
File size: 42.5 KB
Line 
1// License: GPL. For details, see LICENSE file.
2package org.openstreetmap.josm.gui.dialogs.relation;
3
4import static org.openstreetmap.josm.gui.dialogs.relation.WayConnectionType.Direction.BACKWARD;
5import static org.openstreetmap.josm.gui.dialogs.relation.WayConnectionType.Direction.FORWARD;
6import static org.openstreetmap.josm.gui.dialogs.relation.WayConnectionType.Direction.NONE;
7import static org.openstreetmap.josm.gui.dialogs.relation.WayConnectionType.Direction.ROUNDABOUT_LEFT;
8import static org.openstreetmap.josm.gui.dialogs.relation.WayConnectionType.Direction.ROUNDABOUT_RIGHT;
9
10import java.util.ArrayList;
11import java.util.Arrays;
12import java.util.Collection;
13import java.util.Collections;
14import java.util.Comparator;
15import java.util.HashMap;
16import java.util.HashSet;
17import java.util.Iterator;
18import java.util.LinkedList;
19import java.util.List;
20import java.util.Map;
21import java.util.Set;
22import java.util.concurrent.CopyOnWriteArrayList;
23
24import javax.swing.DefaultListSelectionModel;
25import javax.swing.ListSelectionModel;
26import javax.swing.event.TableModelEvent;
27import javax.swing.event.TableModelListener;
28import javax.swing.table.AbstractTableModel;
29
30import org.openstreetmap.josm.Main;
31import org.openstreetmap.josm.data.SelectionChangedListener;
32import org.openstreetmap.josm.data.coor.EastNorth;
33import org.openstreetmap.josm.data.osm.DataSet;
34import org.openstreetmap.josm.data.osm.Node;
35import org.openstreetmap.josm.data.osm.OsmPrimitive;
36import org.openstreetmap.josm.data.osm.Relation;
37import org.openstreetmap.josm.data.osm.RelationMember;
38import org.openstreetmap.josm.data.osm.Way;
39import org.openstreetmap.josm.data.osm.event.AbstractDatasetChangedEvent;
40import org.openstreetmap.josm.data.osm.event.DataChangedEvent;
41import org.openstreetmap.josm.data.osm.event.DataSetListener;
42import org.openstreetmap.josm.data.osm.event.NodeMovedEvent;
43import org.openstreetmap.josm.data.osm.event.PrimitivesAddedEvent;
44import org.openstreetmap.josm.data.osm.event.PrimitivesRemovedEvent;
45import org.openstreetmap.josm.data.osm.event.RelationMembersChangedEvent;
46import org.openstreetmap.josm.data.osm.event.TagsChangedEvent;
47import org.openstreetmap.josm.data.osm.event.WayNodesChangedEvent;
48import org.openstreetmap.josm.gui.dialogs.relation.WayConnectionType.Direction;
49import org.openstreetmap.josm.gui.layer.OsmDataLayer;
50import org.openstreetmap.josm.gui.widgets.OsmPrimitivesTableModel;
51
52public class MemberTableModel extends AbstractTableModel implements TableModelListener, SelectionChangedListener, DataSetListener, OsmPrimitivesTableModel {
53
54 /**
55 * data of the table model: The list of members and the cached WayConnectionType of each member.
56 **/
57 private List<RelationMember> members;
58 private List<WayConnectionType> connectionType = null;
59
60 private DefaultListSelectionModel listSelectionModel;
61 private CopyOnWriteArrayList<IMemberModelListener> listeners;
62 private OsmDataLayer layer;
63
64 private final int UNCONNECTED = Integer.MIN_VALUE;
65
66 private static final Collection<AdditionalSorter> additionalSorters = new ArrayList<AdditionalSorter>();
67
68 static {
69 additionalSorters.add(new AssociatedStreetSorter());
70 }
71
72 /**
73 * constructor
74 */
75 public MemberTableModel(OsmDataLayer layer) {
76 members = new ArrayList<RelationMember>();
77 listeners = new CopyOnWriteArrayList<IMemberModelListener>();
78 this.layer = layer;
79 addTableModelListener(this);
80 }
81
82 public OsmDataLayer getLayer() {
83 return layer;
84 }
85
86 public void register() {
87 DataSet.addSelectionListener(this);
88 getLayer().data.addDataSetListener(this);
89 }
90
91 public void unregister() {
92 DataSet.removeSelectionListener(this);
93 getLayer().data.removeDataSetListener(this);
94 }
95
96 /* --------------------------------------------------------------------------- */
97 /* Interface SelectionChangedListener */
98 /* --------------------------------------------------------------------------- */
99 public void selectionChanged(Collection<? extends OsmPrimitive> newSelection) {
100 if (Main.main.getEditLayer() != this.layer) return;
101 // just trigger a repaint
102 Collection<RelationMember> sel = getSelectedMembers();
103 fireTableDataChanged();
104 setSelectedMembers(sel);
105 }
106
107 /* --------------------------------------------------------------------------- */
108 /* Interface DataSetListener */
109 /* --------------------------------------------------------------------------- */
110 public void dataChanged(DataChangedEvent event) {
111 // just trigger a repaint - the display name of the relation members may
112 // have changed
113 Collection<RelationMember> sel = getSelectedMembers();
114 fireTableDataChanged();
115 setSelectedMembers(sel);
116 }
117
118 public void nodeMoved(NodeMovedEvent event) {/* ignore */}
119 public void primitivesAdded(PrimitivesAddedEvent event) {/* ignore */}
120
121 public void primitivesRemoved(PrimitivesRemovedEvent event) {
122 // ignore - the relation in the editor might become out of sync with the relation
123 // in the dataset. We will deal with it when the relation editor is closed or
124 // when the changes in the editor are applied.
125 }
126
127 public void relationMembersChanged(RelationMembersChangedEvent event) {
128 // ignore - the relation in the editor might become out of sync with the relation
129 // in the dataset. We will deal with it when the relation editor is closed or
130 // when the changes in the editor are applied.
131 }
132
133 public void tagsChanged(TagsChangedEvent event) {
134 // just refresh the respective table cells
135 //
136 Collection<RelationMember> sel = getSelectedMembers();
137 for (int i=0; i < members.size();i++) {
138 if (members.get(i).getMember() == event.getPrimitive()) {
139 fireTableCellUpdated(i, 1 /* the column with the primitive name */);
140 }
141 }
142 setSelectedMembers(sel);
143 }
144
145 public void wayNodesChanged(WayNodesChangedEvent event) {/* ignore */}
146
147 public void otherDatasetChange(AbstractDatasetChangedEvent event) {/* ignore */}
148 /* --------------------------------------------------------------------------- */
149
150 public void addMemberModelListener(IMemberModelListener listener) {
151 if (listener != null) {
152 listeners.addIfAbsent(listener);
153 }
154 }
155
156 public void removeMemberModelListener(IMemberModelListener listener) {
157 listeners.remove(listener);
158 }
159
160 protected void fireMakeMemberVisible(int index) {
161 for (IMemberModelListener listener : listeners) {
162 listener.makeMemberVisible(index);
163 }
164 }
165
166 public void populate(Relation relation) {
167 members.clear();
168 if (relation != null) {
169 // make sure we work with clones of the relation members
170 // in the model.
171 members.addAll(new Relation(relation).getMembers());
172 }
173 fireTableDataChanged();
174 }
175
176 public int getColumnCount() {
177 return 3;
178 }
179
180 public int getRowCount() {
181 return members.size();
182 }
183
184 public Object getValueAt(int rowIndex, int columnIndex) {
185 switch (columnIndex) {
186 case 0:
187 return members.get(rowIndex).getRole();
188 case 1:
189 return members.get(rowIndex).getMember();
190 case 2:
191 return getWayConnection(rowIndex);
192 }
193 // should not happen
194 return null;
195 }
196
197 @Override
198 public boolean isCellEditable(int rowIndex, int columnIndex) {
199 return columnIndex == 0;
200 }
201
202 @Override
203 public void setValueAt(Object value, int rowIndex, int columnIndex) {
204 RelationMember member = members.get(rowIndex);
205 RelationMember newMember = new RelationMember(value.toString(), member.getMember());
206 members.remove(rowIndex);
207 members.add(rowIndex, newMember);
208 }
209
210 @Override
211 public OsmPrimitive getReferredPrimitive(int idx) {
212 return members.get(idx).getMember();
213 }
214
215 public void moveUp(int[] selectedRows) {
216 if (!canMoveUp(selectedRows))
217 return;
218
219 for (int row : selectedRows) {
220 RelationMember member1 = members.get(row);
221 RelationMember member2 = members.get(row - 1);
222 members.set(row, member2);
223 members.set(row - 1, member1);
224 }
225 fireTableDataChanged();
226 getSelectionModel().setValueIsAdjusting(true);
227 getSelectionModel().clearSelection();
228 for (int row : selectedRows) {
229 row--;
230 getSelectionModel().addSelectionInterval(row, row);
231 }
232 getSelectionModel().setValueIsAdjusting(false);
233 fireMakeMemberVisible(selectedRows[0] - 1);
234 }
235
236 public void moveDown(int[] selectedRows) {
237 if (!canMoveDown(selectedRows))
238 return;
239
240 for (int i = selectedRows.length - 1; i >= 0; i--) {
241 int row = selectedRows[i];
242 RelationMember member1 = members.get(row);
243 RelationMember member2 = members.get(row + 1);
244 members.set(row, member2);
245 members.set(row + 1, member1);
246 }
247 fireTableDataChanged();
248 getSelectionModel();
249 getSelectionModel().setValueIsAdjusting(true);
250 getSelectionModel().clearSelection();
251 for (int row : selectedRows) {
252 row++;
253 getSelectionModel().addSelectionInterval(row, row);
254 }
255 getSelectionModel().setValueIsAdjusting(false);
256 fireMakeMemberVisible(selectedRows[0] + 1);
257 }
258
259 public void remove(int[] selectedRows) {
260 if (!canRemove(selectedRows))
261 return;
262 int offset = 0;
263 for (int row : selectedRows) {
264 row -= offset;
265 if (members.size() > row) {
266 members.remove(row);
267 offset++;
268 }
269 }
270 fireTableDataChanged();
271 }
272
273 public boolean canMoveUp(int[] rows) {
274 if (rows == null || rows.length == 0)
275 return false;
276 Arrays.sort(rows);
277 return rows[0] > 0 && members.size() > 0;
278 }
279
280 public boolean canMoveDown(int[] rows) {
281 if (rows == null || rows.length == 0)
282 return false;
283 Arrays.sort(rows);
284 return members.size() > 0 && rows[rows.length - 1] < members.size() - 1;
285 }
286
287 public boolean canRemove(int[] rows) {
288 if (rows == null || rows.length == 0)
289 return false;
290 return true;
291 }
292
293 public DefaultListSelectionModel getSelectionModel() {
294 if (listSelectionModel == null) {
295 listSelectionModel = new DefaultListSelectionModel();
296 listSelectionModel.setSelectionMode(ListSelectionModel.MULTIPLE_INTERVAL_SELECTION);
297 }
298 return listSelectionModel;
299 }
300
301 public void removeMembersReferringTo(List<? extends OsmPrimitive> primitives) {
302 if (primitives == null)
303 return;
304 Iterator<RelationMember> it = members.iterator();
305 while (it.hasNext()) {
306 RelationMember member = it.next();
307 if (primitives.contains(member.getMember())) {
308 it.remove();
309 }
310 }
311 fireTableDataChanged();
312 }
313
314 public void applyToRelation(Relation relation) {
315 relation.setMembers(members);
316 }
317
318 public boolean hasSameMembersAs(Relation relation) {
319 if (relation == null)
320 return false;
321 if (relation.getMembersCount() != members.size())
322 return false;
323 for (int i = 0; i < relation.getMembersCount(); i++) {
324 if (!relation.getMember(i).equals(members.get(i)))
325 return false;
326 }
327 return true;
328 }
329
330 /**
331 * Replies the set of incomplete primitives
332 *
333 * @return the set of incomplete primitives
334 */
335 public Set<OsmPrimitive> getIncompleteMemberPrimitives() {
336 Set<OsmPrimitive> ret = new HashSet<OsmPrimitive>();
337 for (RelationMember member : members) {
338 if (member.getMember().isIncomplete()) {
339 ret.add(member.getMember());
340 }
341 }
342 return ret;
343 }
344
345 /**
346 * Replies the set of selected incomplete primitives
347 *
348 * @return the set of selected incomplete primitives
349 */
350 public Set<OsmPrimitive> getSelectedIncompleteMemberPrimitives() {
351 Set<OsmPrimitive> ret = new HashSet<OsmPrimitive>();
352 for (RelationMember member : getSelectedMembers()) {
353 if (member.getMember().isIncomplete()) {
354 ret.add(member.getMember());
355 }
356 }
357 return ret;
358 }
359
360 /**
361 * Replies true if at least one the relation members is incomplete
362 *
363 * @return true if at least one the relation members is incomplete
364 */
365 public boolean hasIncompleteMembers() {
366 for (RelationMember member : members) {
367 if (member.getMember().isIncomplete())
368 return true;
369 }
370 return false;
371 }
372
373 /**
374 * Replies true if at least one of the selected members is incomplete
375 *
376 * @return true if at least one of the selected members is incomplete
377 */
378 public boolean hasIncompleteSelectedMembers() {
379 for (RelationMember member : getSelectedMembers()) {
380 if (member.getMember().isIncomplete())
381 return true;
382 }
383 return false;
384 }
385
386 protected List<Integer> getSelectedIndices() {
387 ArrayList<Integer> selectedIndices = new ArrayList<Integer>();
388 for (int i = 0; i < members.size(); i++) {
389 if (getSelectionModel().isSelectedIndex(i)) {
390 selectedIndices.add(i);
391 }
392 }
393 return selectedIndices;
394 }
395
396 private void addMembersAtIndex(List<? extends OsmPrimitive> primitives, int index) {
397 if (primitives == null)
398 return;
399 int idx = index;
400 for (OsmPrimitive primitive : primitives) {
401 RelationMember member = new RelationMember("", primitive);
402 members.add(idx++, member);
403 }
404 fireTableDataChanged();
405 getSelectionModel().clearSelection();
406 getSelectionModel().addSelectionInterval(index, index + primitives.size() - 1);
407 fireMakeMemberVisible(index);
408 }
409
410 public void addMembersAtBeginning(List<? extends OsmPrimitive> primitives) {
411 addMembersAtIndex(primitives, 0);
412 }
413
414 public void addMembersAtEnd(List<? extends OsmPrimitive> primitives) {
415 addMembersAtIndex(primitives, members.size());
416 }
417
418 public void addMembersBeforeIdx(List<? extends OsmPrimitive> primitives, int idx) {
419 addMembersAtIndex(primitives, idx);
420 }
421
422 public void addMembersAfterIdx(List<? extends OsmPrimitive> primitives, int idx) {
423 addMembersAtIndex(primitives, idx + 1);
424 }
425
426 /**
427 * Replies the number of members which refer to a particular primitive
428 *
429 * @param primitive the primitive
430 * @return the number of members which refer to a particular primitive
431 */
432 public int getNumMembersWithPrimitive(OsmPrimitive primitive) {
433 int count = 0;
434 for (RelationMember member : members) {
435 if (member.getMember().equals(primitive)) {
436 count++;
437 }
438 }
439 return count;
440 }
441
442 /**
443 * updates the role of the members given by the indices in <code>idx</code>
444 *
445 * @param idx the array of indices
446 * @param role the new role
447 */
448 public void updateRole(int[] idx, String role) {
449 if (idx == null || idx.length == 0)
450 return;
451 for (int row : idx) {
452 RelationMember oldMember = members.get(row);
453 RelationMember newMember = new RelationMember(role, oldMember.getMember());
454 members.remove(row);
455 members.add(row, newMember);
456 }
457 fireTableDataChanged();
458 for (int row : idx) {
459 getSelectionModel().addSelectionInterval(row, row);
460 }
461 }
462
463 /**
464 * Get the currently selected relation members
465 *
466 * @return a collection with the currently selected relation members
467 */
468 public Collection<RelationMember> getSelectedMembers() {
469 ArrayList<RelationMember> selectedMembers = new ArrayList<RelationMember>();
470 for (int i : getSelectedIndices()) {
471 selectedMembers.add(members.get(i));
472 }
473 return selectedMembers;
474 }
475
476 /**
477 * Replies the set of selected referers. Never null, but may be empty.
478 *
479 * @return the set of selected referers
480 */
481 public Collection<OsmPrimitive> getSelectedChildPrimitives() {
482 Collection<OsmPrimitive> ret = new ArrayList<OsmPrimitive>();
483 for (RelationMember m: getSelectedMembers()) {
484 ret.add(m.getMember());
485 }
486 return ret;
487 }
488
489 /**
490 * Replies the set of selected referers. Never null, but may be empty.
491 *
492 * @return the set of selected referers
493 */
494 public Set<OsmPrimitive> getChildPrimitives(Collection<? extends OsmPrimitive> referenceSet) {
495 HashSet<OsmPrimitive> ret = new HashSet<OsmPrimitive>();
496 if (referenceSet == null) return null;
497 for (RelationMember m: members) {
498 if (referenceSet.contains(m.getMember())) {
499 ret.add(m.getMember());
500 }
501 }
502 return ret;
503 }
504
505 /**
506 * Selects the members in the collection selectedMembers
507 *
508 * @param selectedMembers the collection of selected members
509 */
510 public void setSelectedMembers(Collection<RelationMember> selectedMembers) {
511 if (selectedMembers == null || selectedMembers.isEmpty()) {
512 getSelectionModel().clearSelection();
513 return;
514 }
515
516 // lookup the indices for the respective members
517 //
518 Set<Integer> selectedIndices = new HashSet<Integer>();
519 for (RelationMember member : selectedMembers) {
520 for (int idx = 0; idx < members.size(); ++idx) {
521 if (member.equals(members.get(idx))) {
522 selectedIndices.add(idx);
523 }
524 }
525 }
526 setSelectedMembersIdx(selectedIndices);
527 }
528
529 /**
530 * Selects the members in the collection selectedIndices
531 *
532 * @param selectedIndices the collection of selected member indices
533 */
534 public void setSelectedMembersIdx(Collection<Integer> selectedIndices) {
535 if (selectedIndices == null || selectedIndices.isEmpty()) {
536 getSelectionModel().clearSelection();
537 return;
538 }
539 // select the members
540 //
541 getSelectionModel().setValueIsAdjusting(true);
542 getSelectionModel().clearSelection();
543 for (int row : selectedIndices) {
544 getSelectionModel().addSelectionInterval(row, row);
545 }
546 getSelectionModel().setValueIsAdjusting(false);
547 // make the first selected member visible
548 //
549 if (selectedIndices.size() > 0) {
550 fireMakeMemberVisible(Collections.min(selectedIndices));
551 }
552 }
553
554 /**
555 * Replies true if the index-th relation members referrs
556 * to an editable relation, i.e. a relation which is not
557 * incomplete.
558 *
559 * @param index the index
560 * @return true, if the index-th relation members referrs
561 * to an editable relation, i.e. a relation which is not
562 * incomplete
563 */
564 public boolean isEditableRelation(int index) {
565 if (index < 0 || index >= members.size())
566 return false;
567 RelationMember member = members.get(index);
568 if (!member.isRelation())
569 return false;
570 Relation r = member.getRelation();
571 return !r.isIncomplete();
572 }
573
574 /**
575 * Replies true if there is at least one relation member given as {@code members}
576 * which refers to at least on the primitives in {@code primitives}.
577 *
578 * @param members the members
579 * @param primitives the collection of primitives
580 * @return true if there is at least one relation member in this model
581 * which refers to at least on the primitives in <code>primitives</code>; false
582 * otherwise
583 */
584 public static boolean hasMembersReferringTo(Collection<RelationMember> members, Collection<OsmPrimitive> primitives) {
585 if (primitives == null || primitives.isEmpty()) {
586 return false;
587 }
588 HashSet<OsmPrimitive> referrers = new HashSet<OsmPrimitive>();
589 for (RelationMember member : members) {
590 referrers.add(member.getMember());
591 }
592 for (OsmPrimitive referred : primitives) {
593 if (referrers.contains(referred)) {
594 return true;
595 }
596 }
597 return false;
598 }
599
600 /**
601 * Replies true if there is at least one relation member in this model
602 * which refers to at least on the primitives in <code>primitives</code>.
603 *
604 * @param primitives the collection of primitives
605 * @return true if there is at least one relation member in this model
606 * which refers to at least on the primitives in <code>primitives</code>; false
607 * otherwise
608 */
609 public boolean hasMembersReferringTo(Collection<OsmPrimitive> primitives) {
610 return hasMembersReferringTo(members, primitives);
611 }
612
613 /**
614 * Selects all mebers which refer to {@link OsmPrimitive}s in the collections
615 * <code>primitmives</code>. Does nothing is primitives is null.
616 *
617 * @param primitives the collection of primitives
618 */
619 public void selectMembersReferringTo(Collection<? extends OsmPrimitive> primitives) {
620 if (primitives == null) return;
621 getSelectionModel().setValueIsAdjusting(true);
622 getSelectionModel().clearSelection();
623 for (int i=0; i< members.size();i++) {
624 RelationMember m = members.get(i);
625 if (primitives.contains(m.getMember())) {
626 this.getSelectionModel().addSelectionInterval(i,i);
627 }
628 }
629 getSelectionModel().setValueIsAdjusting(false);
630 if (getSelectedIndices().size() > 0) {
631 fireMakeMemberVisible(getSelectedIndices().get(0));
632 }
633 }
634
635 /**
636 * Replies true if <code>primitive</code> is currently selected in the layer this
637 * model is attached to
638 *
639 * @param primitive the primitive
640 * @return true if <code>primitive</code> is currently selected in the layer this
641 * model is attached to, false otherwise
642 */
643 public boolean isInJosmSelection(OsmPrimitive primitive) {
644 return layer.data.isSelected(primitive);
645 }
646
647 /**
648 * Replies true if the layer this model belongs to is equal to the active
649 * layer
650 *
651 * @return true if the layer this model belongs to is equal to the active
652 * layer
653 */
654 protected boolean isActiveLayer() {
655 if (Main.map == null || Main.map.mapView == null) return false;
656 return Main.map.mapView.getActiveLayer() == layer;
657 }
658
659 /**
660 * get a node we can link against when sorting members
661 * @param element the element we want to link against
662 * @param linked_element already linked against element
663 * @return the unlinked node if element is a way, the node itself if element is a node, null otherwise
664 */
665 /*private static Node getUnusedNode(RelationMember element, RelationMember linked_element)
666 {
667 Node result = null;
668
669 if (element.isWay()) {
670 Way w = element.getWay();
671 if (linked_element.isWay()) {
672 Way x = linked_element.getWay();
673 if ((w.firstNode() == x.firstNode()) || (w.firstNode() == x.lastNode())) {
674 result = w.lastNode();
675 } else {
676 result = w.firstNode();
677 }
678 } else if (linked_element.isNode()) {
679 Node m = linked_element.getNode();
680 if (w.firstNode() == m) {
681 result = w.lastNode();
682 } else {
683 result = w.firstNode();
684 }
685 }
686 } else if (element.isNode()) {
687 Node n = element.getNode();
688 result = n;
689 }
690
691 return result;
692 }*/
693
694 /*
695 * Sort a collection of relation members by the way they are linked.
696 *
697 * @param relationMembers collection of relation members
698 * @return sorted collection of relation members
699 */
700 private List<RelationMember> sortMembers(List<RelationMember> relationMembers) {
701 ArrayList<RelationMember> newMembers = new ArrayList<RelationMember>();
702
703 // Sort members with custom mechanisms (relation-dependent)
704 List<RelationMember> defaultMembers = new LinkedList<RelationMember>();
705 Map<AdditionalSorter, List<RelationMember>> customMap = new HashMap<AdditionalSorter, List<RelationMember>>();
706
707 // Dispatch members to correct sorters
708 for (RelationMember m : relationMembers) {
709 for (AdditionalSorter sorter : additionalSorters) {
710 List<RelationMember> list = defaultMembers;
711 if (sorter.acceptsMember(m)) {
712 list = customMap.get(sorter);
713 if (list == null) {
714 customMap.put(sorter, list = new LinkedList<RelationMember>());
715 }
716 }
717 list.add(m);
718 }
719 }
720
721 // Sort members and add them to result
722 for (AdditionalSorter s : customMap.keySet()) {
723 newMembers.addAll(s.sortMembers(customMap.get(s)));
724 }
725
726 RelationNodeMap map = new RelationNodeMap(defaultMembers);
727 // List of groups of linked members
728 //
729 ArrayList<LinkedList<Integer>> allGroups = new ArrayList<LinkedList<Integer>>();
730
731 // current group of members that are linked among each other
732 // Two successive members are always linked i.e. have a common node.
733 //
734 LinkedList<Integer> group;
735
736 Integer first;
737 while ((first = map.pop()) != null) {
738 group = new LinkedList<Integer>();
739 group.add(first);
740
741 allGroups.add(group);
742
743 Integer next = first;
744 while ((next = map.popAdjacent(next)) != null) {
745 group.addLast(next);
746 }
747
748 // The first element need not be in front of the list.
749 // So the search goes in both directions
750 //
751 next = first;
752 while ((next = map.popAdjacent(next)) != null) {
753 group.addFirst(next);
754 }
755 }
756
757 for (LinkedList<Integer> tmpGroup : allGroups) {
758 for (Integer p : tmpGroup) {
759 newMembers.add(defaultMembers.get(p));
760 }
761 }
762
763 // Finally, add members that have not been sorted at all
764 for (Integer i : map.getNotSortableMembers()) {
765 newMembers.add(defaultMembers.get(i));
766 }
767
768 return newMembers;
769 }
770
771 /**
772 * Sort the selected relation members by the way they are linked.
773 */
774 void sort() {
775 List<RelationMember> selectedMembers = new ArrayList<RelationMember>(getSelectedMembers());
776 List<RelationMember> sortedMembers = null;
777 List<RelationMember> newMembers;
778 if (selectedMembers.size() <= 1) {
779 newMembers = sortMembers(members);
780 sortedMembers = newMembers;
781 } else {
782 sortedMembers = sortMembers(selectedMembers);
783 List<Integer> selectedIndices = getSelectedIndices();
784 newMembers = new ArrayList<RelationMember>();
785 boolean inserted = false;
786 for (int i=0; i < members.size(); i++) {
787 if (selectedIndices.contains(i)) {
788 if (!inserted) {
789 newMembers.addAll(sortedMembers);
790 inserted = true;
791 }
792 } else {
793 newMembers.add(members.get(i));
794 }
795 }
796 }
797
798 if (members.size() != newMembers.size()) throw new AssertionError();
799
800 members.clear();
801 members.addAll(newMembers);
802 fireTableDataChanged();
803 setSelectedMembers(sortedMembers);
804 }
805
806 private Direction determineDirection(int ref_i, Direction ref_direction, int k) {
807 return determineDirection(ref_i, ref_direction, k, false);
808 }
809 /**
810 * Determines the direction of way k with respect to the way ref_i.
811 * The way ref_i is assumed to have the direction ref_direction and
812 * to be the predecessor of k.
813 *
814 * If both ways are not linked in any way, NONE is returned.
815 *
816 * Else the direction is given as follows:
817 * Let the relation be a route of oneway streets, and someone travels them in the given order.
818 * Direction is FORWARD if it is legal and BACKWARD if it is illegal to do so for the given way.
819 *
820 **/
821 private Direction determineDirection(int ref_i, final Direction ref_direction, int k, boolean reversed) {
822 if (ref_i < 0 || k < 0 || ref_i >= members.size() || k >= members.size())
823 return NONE;
824 if (ref_direction == NONE)
825 return NONE;
826
827 final RelationMember m_ref = members.get(ref_i);
828 final RelationMember m = members.get(k);
829 Way way_ref = null;
830 Way way = null;
831
832 if (m_ref.isWay()) {
833 way_ref = m_ref.getWay();
834 }
835 if (m.isWay()) {
836 way = m.getWay();
837 }
838
839 if (way_ref == null || way == null)
840 return NONE;
841
842 /** the list of nodes the way k can dock to */
843 List<Node> refNodes= new ArrayList<Node>();
844
845 switch (ref_direction) {
846 case FORWARD:
847 refNodes.add(way_ref.lastNode());
848 break;
849 case BACKWARD:
850 refNodes.add(way_ref.firstNode());
851 break;
852 case ROUNDABOUT_LEFT:
853 case ROUNDABOUT_RIGHT:
854 refNodes = way_ref.getNodes();
855 break;
856 }
857
858 if (refNodes == null)
859 return NONE;
860
861 for (Node n : refNodes) {
862 if (n == null) {
863 continue;
864 }
865 if (roundaboutType(k) != NONE) {
866 for (Node nn : way.getNodes()) {
867 if (n == nn)
868 return roundaboutType(k);
869 }
870 } else if(isOneway(m)) {
871 if (n == RelationNodeMap.firstOnewayNode(m) && !reversed) {
872 if(isBackward(m))
873 return BACKWARD;
874 else
875 return FORWARD;
876 }
877 if (n == RelationNodeMap.lastOnewayNode(m) && reversed) {
878 if(isBackward(m))
879 return FORWARD;
880 else
881 return BACKWARD;
882 }
883 } else {
884 if (n == way.firstNode())
885 return FORWARD;
886 if (n == way.lastNode())
887 return BACKWARD;
888 }
889 }
890 return NONE;
891 }
892
893 /**
894 * determine, if the way i is a roundabout and if yes, what type of roundabout
895 */
896 private Direction roundaboutType(int i) {
897 RelationMember m = members.get(i);
898 if (m == null || !m.isWay()) return NONE;
899 Way w = m.getWay();
900 return roundaboutType(w);
901 }
902 static Direction roundaboutType(Way w) {
903 if (w != null &&
904 "roundabout".equals(w.get("junction")) &&
905 w.getNodesCount() < 200 &&
906 w.getNodesCount() > 2 &&
907 w.getNode(0) != null &&
908 w.getNode(1) != null &&
909 w.getNode(2) != null &&
910 w.firstNode() == w.lastNode()) {
911 /** do some simple determinant / cross pruduct test on the first 3 nodes
912 to see, if the roundabout goes clock wise or ccw */
913 EastNorth en1 = w.getNode(0).getEastNorth();
914 EastNorth en2 = w.getNode(1).getEastNorth();
915 EastNorth en3 = w.getNode(2).getEastNorth();
916 if (en1 != null && en2 != null && en3 != null) {
917 en1 = en1.sub(en2);
918 en2 = en2.sub(en3);
919 return en1.north() * en2.east() - en2.north() * en1.east() > 0 ? ROUNDABOUT_LEFT : ROUNDABOUT_RIGHT;
920 }
921 }
922 return NONE;
923 }
924
925 WayConnectionType getWayConnection(int i) {
926 if (connectionType == null) {
927 updateLinks();
928 }
929 return connectionType.get(i);
930 }
931
932 public void tableChanged(TableModelEvent e) {
933 connectionType = null;
934 }
935
936 /**
937 * Reverse the relation members.
938 */
939 void reverse() {
940 List<Integer> selectedIndices = getSelectedIndices();
941 List<Integer> selectedIndicesReversed = getSelectedIndices();
942
943 if (selectedIndices.size() <= 1) {
944 Collections.reverse(members);
945 fireTableDataChanged();
946 setSelectedMembers(members);
947 } else {
948 Collections.reverse(selectedIndicesReversed);
949
950 ArrayList<RelationMember> newMembers = new ArrayList<RelationMember>(members);
951
952 for (int i=0; i < selectedIndices.size(); i++) {
953 newMembers.set(selectedIndices.get(i), members.get(selectedIndicesReversed.get(i)));
954 }
955
956 if (members.size() != newMembers.size()) throw new AssertionError();
957 members.clear();
958 members.addAll(newMembers);
959 fireTableDataChanged();
960 setSelectedMembersIdx(selectedIndices);
961 }
962 }
963
964 /**
965 * refresh the cache of member WayConnectionTypes
966 */
967 public void updateLinks() {
968 connectionType = null;
969 final List<WayConnectionType> con = new ArrayList<WayConnectionType>();
970
971 for (int i=0; i<members.size(); ++i) {
972 con.add(null);
973 }
974
975 firstGroupIdx=0;
976
977 lastForwardWay = UNCONNECTED;
978 lastBackwardWay = UNCONNECTED;
979 onewayBeginning = false;
980 WayConnectionType lastWct = null;
981
982 for (int i=0; i<members.size(); ++i) {
983 final RelationMember m = members.get(i);
984 if (!m.isWay() || m.getWay() == null || m.getWay().isIncomplete()) {
985 if(i > 0) {
986 makeLoopIfNeeded(con, i-1);
987 }
988 con.set(i, new WayConnectionType());
989 firstGroupIdx = i;
990 continue;
991 }
992
993 WayConnectionType wct = new WayConnectionType(false);
994 wct.linkPrev = i>0 && con.get(i-1) != null && con.get(i-1).isValid();
995 wct.direction = NONE;
996
997 if(isOneway(m)){
998 if(lastWct != null && lastWct.isOnewayTail) {
999 wct.isOnewayHead = true;
1000 }
1001 if(lastBackwardWay == UNCONNECTED && lastForwardWay == UNCONNECTED){ //Beginning of new oneway
1002 wct.isOnewayHead = true;
1003 lastForwardWay = i-1;
1004 lastBackwardWay = i-1;
1005 onewayBeginning = true;
1006 }
1007 }
1008
1009 if (wct.linkPrev) {
1010 if(lastBackwardWay != UNCONNECTED && lastForwardWay != UNCONNECTED) {
1011 wct = determineOnewayConnectionType(con, m, i, wct);
1012 if(!wct.linkPrev) {
1013 firstGroupIdx = i;
1014 }
1015 }
1016
1017 if(!isOneway(m)) {
1018 wct.direction = determineDirection(i-1, lastWct.direction, i);
1019 wct.linkPrev = (wct.direction != NONE);
1020 }
1021 }
1022
1023 if (!wct.linkPrev) {
1024 wct.direction = determineDirectionOfFirst(i, m);
1025 if(isOneway(m)){
1026 wct.isOnewayLoopForwardPart = true;
1027 lastForwardWay = i;
1028 }
1029 }
1030
1031 wct.linkNext = false;
1032 if(lastWct != null) {
1033 lastWct.linkNext = wct.linkPrev;
1034 }
1035 con.set(i, wct);
1036 lastWct = wct;
1037
1038 if(!wct.linkPrev) {
1039 if(i > 0) {
1040 makeLoopIfNeeded(con, i-1);
1041 }
1042 firstGroupIdx = i;
1043 }
1044 }
1045 makeLoopIfNeeded(con, members.size()-1);
1046 connectionType = con;
1047 }
1048
1049 // private static void unconnectPreviousLink(List<WayConnectionType> con, int beg, boolean backward){
1050 // int i = beg;
1051 // while(true){
1052 // WayConnectionType t = con.get(i--);
1053 // t.isOnewayOppositeConnected = false;
1054 // if(backward && t.isOnewayLoopBackwardPart) break;
1055 // if(!backward && t.isOnewayLoopForwardPart) break;
1056 // }
1057 // }
1058
1059 private static Direction reverse(final Direction dir){
1060 if(dir == FORWARD) return BACKWARD;
1061 if(dir == BACKWARD) return FORWARD;
1062 return dir;
1063 }
1064
1065 private static boolean isBackward(final RelationMember member){
1066 return member.getRole().equals("backward");
1067 }
1068
1069 private static boolean isForward(final RelationMember member){
1070 return member.getRole().equals("forward");
1071 }
1072
1073 public static boolean isOneway(final RelationMember member){
1074 return isForward(member) || isBackward(member);
1075 }
1076
1077 int firstGroupIdx;
1078 private void makeLoopIfNeeded(final List<WayConnectionType> con, final int i) {
1079 boolean loop;
1080 if (i == firstGroupIdx) { //is primitive loop
1081 loop = determineDirection(i, FORWARD, i) == FORWARD;
1082 } else {
1083 loop = determineDirection(i, con.get(i).direction, firstGroupIdx) == con.get(firstGroupIdx).direction;
1084 }
1085 if (loop) {
1086 for (int j=firstGroupIdx; j <= i; ++j) {
1087 con.get(j).isLoop = true;
1088 }
1089 }
1090 }
1091
1092 private Direction determineDirectionOfFirst(final int i, final RelationMember m) {
1093 if (roundaboutType(i) != NONE)
1094 return roundaboutType(i);
1095
1096 if (isOneway(m)){
1097 if(isBackward(m)) return BACKWARD;
1098 else return FORWARD;
1099 } else { /** guess the direction and see if it fits with the next member */
1100 if(determineDirection(i, FORWARD, i+1) != NONE) return FORWARD;
1101 if(determineDirection(i, BACKWARD, i+1) != NONE) return BACKWARD;
1102 }
1103 return NONE;
1104 }
1105
1106 int lastForwardWay, lastBackwardWay;
1107 boolean onewayBeginning;
1108 private WayConnectionType determineOnewayConnectionType(final List<WayConnectionType> con,
1109 RelationMember m, int i, final WayConnectionType wct) {
1110 Direction dirFW = determineDirection(lastForwardWay, con.get(lastForwardWay).direction, i);
1111 Direction dirBW = NONE;
1112 if(onewayBeginning) {
1113 if(lastBackwardWay < 0) {
1114 dirBW = determineDirection(firstGroupIdx, reverse(con.get(firstGroupIdx).direction), i, true);
1115 } else {
1116 dirBW = determineDirection(lastBackwardWay, con.get(lastBackwardWay).direction, i, true);
1117 }
1118
1119 if(dirBW != NONE) {
1120 onewayBeginning = false;
1121 }
1122 } else {
1123 dirBW = determineDirection(lastBackwardWay, con.get(lastBackwardWay).direction, i, true);
1124 }
1125
1126 if(isOneway(m)) {
1127 if(dirBW != NONE){
1128 wct.direction = dirBW;
1129 lastBackwardWay = i;
1130 wct.isOnewayLoopBackwardPart = true;
1131 }
1132 if(dirFW != NONE){
1133 wct.direction = dirFW;
1134 lastForwardWay = i;
1135 wct.isOnewayLoopForwardPart = true;
1136 }
1137 if(dirFW == NONE && dirBW == NONE) { //Not connected to previous
1138 // unconnectPreviousLink(con, i, true);
1139 // unconnectPreviousLink(con, i, false);
1140 wct.linkPrev = false;
1141 if(isOneway(m)){
1142 wct.isOnewayHead = true;
1143 lastForwardWay = i-1;
1144 lastBackwardWay = i-1;
1145 } else {
1146 lastForwardWay = UNCONNECTED;
1147 lastBackwardWay = UNCONNECTED;
1148 }
1149 onewayBeginning = true;
1150 }
1151
1152 if(dirFW != NONE && dirBW != NONE) { //End of oneway loop
1153 if(i+1<members.size() && determineDirection(i, dirFW, i+1) != NONE) {
1154 wct.isOnewayLoopBackwardPart = false;
1155 dirBW = NONE;
1156 wct.direction = dirFW;
1157 } else {
1158 wct.isOnewayLoopForwardPart = false;
1159 dirFW = NONE;
1160 wct.direction = dirBW;
1161 }
1162
1163 wct.isOnewayTail = true;
1164 }
1165
1166 } else {
1167 lastForwardWay = UNCONNECTED;
1168 lastBackwardWay = UNCONNECTED;
1169 if(dirFW == NONE || dirBW == NONE) {
1170 wct.linkPrev = false;
1171 }
1172 }
1173 return wct;
1174 }
1175
1176 private static interface AdditionalSorter {
1177 public boolean acceptsMember(RelationMember m);
1178 public List<RelationMember> sortMembers(List<RelationMember> list);
1179 }
1180
1181 /**
1182 * Class that sorts type=associatedStreet relation's houses.
1183 */
1184 private static class AssociatedStreetSorter implements AdditionalSorter {
1185
1186 @Override
1187 public boolean acceptsMember(RelationMember m) {
1188 return m != null
1189 && m.getRole() != null && m.getRole().equals("house")
1190 && m.getMember() != null && m.getMember().get("addr:housenumber") != null;
1191 }
1192
1193 @Override
1194 public List<RelationMember> sortMembers(List<RelationMember> list) {
1195 Collections.sort(list, new Comparator<RelationMember>() {
1196 @Override
1197 public int compare(RelationMember a, RelationMember b) {
1198 if (a == b || a.getMember() == b.getMember()) return 0;
1199 String addrA = a.getMember().get("addr:housenumber").trim();
1200 String addrB = b.getMember().get("addr:housenumber").trim();
1201 if (addrA.equals(addrB)) return 0;
1202 // Strip non-digits (from "1B" addresses for example)
1203 String addrAnum = addrA.replaceAll("\\D+", "");
1204 String addrBnum = addrB.replaceAll("\\D+", "");
1205 // Compare only numbers
1206 try {
1207 Integer res = Integer.parseInt(addrAnum) - Integer.parseInt(addrBnum);
1208 if (res != 0) return res;
1209 } catch (NumberFormatException e) {
1210 // Ignore NumberFormatException. If the number is not composed of digits, strings are compared next
1211 }
1212 // Same number ? Compare full strings
1213 return addrA.compareTo(addrB);
1214 }
1215 });
1216 return list;
1217 }
1218 }
1219}
Note: See TracBrowser for help on using the repository browser.