source: josm/trunk/test/unit/org/openstreetmap/josm/data/osm/DataSetMergerTest.java@ 14120

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

see #15229 - deprecate all Main methods related to projections. New ProjectionRegistry class
  • Property svn:eol-style set to native
File size: 31.2 KB
Line 
1// License: GPL. For details, see LICENSE file.
2package org.openstreetmap.josm.data.osm;
3
4import static org.junit.Assert.assertEquals;
5import static org.junit.Assert.assertFalse;
6import static org.junit.Assert.assertNotNull;
7import static org.junit.Assert.assertNotSame;
8import static org.junit.Assert.assertSame;
9import static org.junit.Assert.assertTrue;
10import static org.junit.Assert.fail;
11
12import java.io.StringWriter;
13import java.time.Instant;
14import java.util.Arrays;
15import java.util.Date;
16
17import org.junit.After;
18import org.junit.Before;
19import org.junit.Rule;
20import org.junit.Test;
21import org.openstreetmap.josm.data.coor.LatLon;
22import org.openstreetmap.josm.data.projection.ProjectionRegistry;
23import org.openstreetmap.josm.data.projection.Projections;
24import org.openstreetmap.josm.testutils.JOSMTestRules;
25
26import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
27/**
28 * Unit tests for class {@link DataSetMerger}.
29 */
30public class DataSetMergerTest {
31
32 /**
33 * Setup test.
34 */
35 @Rule
36 @SuppressFBWarnings(value = "URF_UNREAD_PUBLIC_OR_PROTECTED_FIELD")
37 public JOSMTestRules test = new JOSMTestRules();
38
39 private DataSet my;
40 private DataSet their;
41
42 /**
43 * Setup test.
44 */
45 @Before
46 public void setUp() {
47 my = new DataSet();
48 my.setVersion("0.6");
49 their = new DataSet();
50 their.setVersion("0.6");
51 ProjectionRegistry.setProjection(Projections.getProjectionByCode("EPSG:3857")); // Mercator
52 }
53
54 private void runConsistencyTests(DataSet ds) {
55 StringWriter writer = new StringWriter();
56 DatasetConsistencyTest test = new DatasetConsistencyTest(ds, writer);
57 test.checkReferrers();
58 test.checkCompleteWaysWithIncompleteNodes();
59 test.searchNodes();
60 test.searchWays();
61 test.referredPrimitiveNotInDataset();
62 test.checkZeroNodesWays();
63 String result = writer.toString();
64 if (!result.isEmpty())
65 fail(result);
66 }
67
68 @After
69 public void checkDatasets() {
70 runConsistencyTests(my);
71 runConsistencyTests(their);
72 }
73
74 /**
75 * two identical nodes, even in id and version. No confict expected.
76 *
77 * Can happen if data is loaded in two layers and then merged from one layer
78 * on the other.
79 */
80 @Test
81 public void testNodeSimpleIdenticalNoConflict() {
82 Node n = new Node(LatLon.ZERO);
83 n.setOsmId(1, 1);
84 n.setModified(false);
85 n.put("key1", "value1");
86 my.addPrimitive(n);
87
88 Node n1 = new Node(LatLon.ZERO);
89 n1.setOsmId(1, 1);
90 n1.setModified(false);
91 n1.put("key1", "value1");
92 their.addPrimitive(n1);
93
94
95 DataSetMerger visitor = new DataSetMerger(my, their);
96 visitor.merge();
97
98 Node n2 = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
99 assertTrue(visitor.getConflicts().isEmpty());
100 assertNotSame(n1, n2); // make sure we have a clone
101 assertEquals(1, n2.getId());
102 assertEquals(1, n2.getVersion());
103 assertFalse(n2.isModified());
104 assertEquals("value1", n2.get("key1"));
105
106 // merge target not modified after merging
107 assertFalse(n2.isModified());
108 }
109
110 /**
111 * two nodes, my is unmodified, their is updated and has a higher version
112 * => their version is going to be the merged version
113 */
114 @Test
115 public void testNodeSimpleLocallyUnmodifiedNoConflict() {
116 Node n = new Node(LatLon.ZERO);
117 n.setOsmId(1, 1);
118 n.setModified(false);
119 n.put("key1", "value1");
120 my.addPrimitive(n);
121
122 Node n1 = new Node(LatLon.ZERO);
123 n1.setOsmId(1, 2);
124 n1.setModified(false);
125 n1.put("key1", "value1-new");
126 n1.put("key2", "value2");
127 their.addPrimitive(n1);
128
129
130 DataSetMerger visitor = new DataSetMerger(my, their);
131 visitor.merge();
132
133 Node n2 = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
134 assertTrue(visitor.getConflicts().isEmpty());
135 assertSame(n, n2); // make sure the merged node is still the original node
136 assertSame(n2.getDataSet(), my);
137 assertEquals(1, n2.getId());
138 assertEquals(2, n2.getVersion());
139 assertFalse(n2.isModified());
140 assertEquals("value1-new", n2.get("key1"));
141 assertEquals("value2", n2.get("key2"));
142
143 // the merge target should not be modified
144 assertFalse(n2.isModified());
145 }
146
147 /**
148 * Node with same id, my is modified, their has a higher version
149 * => results in a conflict
150 *
151 * Use case: node which is modified locally and updated by another mapper on
152 * the server
153 */
154 @Test
155 public void testNodeSimpleTagConflict() {
156 Node n = new Node(LatLon.ZERO);
157 n.setOsmId(1, 1);
158 n.setModified(true);
159 n.put("key1", "value1");
160 n.put("key2", "value2");
161 my.addPrimitive(n);
162
163 Node n1 = new Node(LatLon.ZERO);
164 n1.setOsmId(1, 2);
165 n1.setModified(false);
166 n1.put("key1", "value1-new");
167
168 their.addPrimitive(n1);
169
170
171 DataSetMerger visitor = new DataSetMerger(my, their);
172 visitor.merge();
173
174 Node n2 = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
175 assertEquals(1, visitor.getConflicts().size());
176 assertSame(n, n2);
177 assertNotSame(n1, n2);
178 assertSame(n1.getDataSet(), their);
179 }
180
181 /**
182 * node with same id, my is deleted, their has a higher version
183 * => results in a conflict
184 *
185 * Use case: node which is deleted locally and updated by another mapper on
186 * the server
187 */
188 @Test
189 public void testNodeSimpleDeleteConflict() {
190 Node n = new Node(1, 1);
191 n.setCoor(LatLon.ZERO);
192 n.setDeleted(true);
193 n.put("key1", "value1");
194 my.addPrimitive(n);
195
196 Node n1 = new Node(LatLon.ZERO);
197 n1.setOsmId(1, 2);
198 n1.setModified(false);
199 n1.put("key1", "value1-new");
200 n1.put("key2", "value2");
201 their.addPrimitive(n1);
202
203
204 DataSetMerger visitor = new DataSetMerger(my, their);
205 visitor.merge();
206
207 Node n2 = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
208 assertEquals(1, visitor.getConflicts().size());
209 assertSame(n, n2);
210 assertNotSame(n1, n2);
211 assertSame(n1.getDataSet(), their);
212 }
213
214 /**
215 * My node is deleted, their node has the same id and version and is not deleted.
216 * => mine has precedence
217 */
218 @Test
219 public void testNodeSimpleDeleteConflict2() {
220 Node n = new Node(LatLon.ZERO);
221 n.setOsmId(1, 1);
222 n.setDeleted(true);
223 my.addPrimitive(n);
224
225 Node n1 = new Node(LatLon.ZERO);
226 n1.setOsmId(1, 1);
227 their.addPrimitive(n1);
228
229
230 DataSetMerger visitor = new DataSetMerger(my, their);
231 visitor.merge();
232
233 Node n2 = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
234 assertEquals(0, visitor.getConflicts().size());
235 assertTrue(n2.isVisible());
236 assertSame(n, n2);
237 assertSame(n.getDataSet(), my);
238 assertSame(n1.getDataSet(), their);
239 }
240
241 /**
242 * My and their node are new but semantically equal. My node is deleted.
243 *
244 * => Ignore my node, no conflict
245 */
246 @Test
247 public void testNodeSimpleDeleteConflict3() {
248 Node n = new Node(new LatLon(1, 1));
249 n.setDeleted(true);
250 my.addPrimitive(n);
251
252 Node n1 = new Node(new LatLon(1, 1));
253 their.addPrimitive(n1);
254
255
256 DataSetMerger visitor = new DataSetMerger(my, their);
257 visitor.merge();
258
259 assertEquals(0, visitor.getConflicts().size());
260 assertSame(n.getDataSet(), my);
261 assertSame(n1.getDataSet(), their);
262 }
263
264 /**
265 * My and their node are new but semantically equal. Both are deleted.
266 *
267 * => take mine
268 */
269 @Test
270 public void testNodeSimpleDeleteConflict4() {
271 Node n = new Node(new LatLon(1, 1));
272 n.setDeleted(true);
273 my.addPrimitive(n);
274
275 Node n1 = new Node(new LatLon(1, 1));
276 n1.setDeleted(true);
277 their.addPrimitive(n1);
278
279 DataSetMerger visitor = new DataSetMerger(my, their);
280 visitor.merge();
281
282 assertEquals(0, visitor.getConflicts().size());
283 Node n2 = (Node) my.getNodes().toArray()[0];
284 assertSame(n2, n);
285 assertTrue(n2.isDeleted());
286 }
287
288 /**
289 * their node has no assigned id (id == 0) and is semantically equal to one of my
290 * nodes with id == 0
291 *
292 * => merge it onto my node.
293 */
294 @Test
295 public void testNodeSimpleNoIdSemanticallyEqual() {
296
297 User myUser = User.createOsmUser(1111, "my");
298
299 User theirUser = User.createOsmUser(222, "their");
300
301 Node n = new Node();
302 n.setCoor(LatLon.ZERO);
303 n.put("key1", "value1");
304 n.setUser(myUser);
305 n.setTimestamp(new Date());
306
307 my.addPrimitive(n);
308
309 Node n1 = new Node();
310 n1.setCoor(LatLon.ZERO);
311 n1.put("key1", "value1");
312 n1.setTimestamp(Date.from(Instant.now().plusSeconds(3600)));
313 n1.setUser(theirUser);
314 their.addPrimitive(n1);
315
316 DataSetMerger visitor = new DataSetMerger(my, their);
317 visitor.merge();
318
319 Node n2 = my.getNodes().iterator().next();
320 assertEquals(0, visitor.getConflicts().size());
321 assertEquals("value1", n2.get("key1"));
322 assertEquals(n1.getRawTimestamp(), n2.getRawTimestamp());
323 assertEquals(theirUser, n2.getUser());
324 assertSame(n2, n);
325 assertNotSame(n2, n1);
326 assertSame(n2.getDataSet(), my);
327 }
328
329 /**
330 * my node is incomplete, their node is complete
331 *
332 * => merge it onto my node. My node becomes complete
333 */
334 @Test
335 public void testNodeSimpleIncompleteNode() {
336
337 Node n = new Node(1);
338 my.addPrimitive(n);
339
340 Node n1 = new Node();
341 n1.setCoor(LatLon.ZERO);
342 n1.setOsmId(1, 1);
343 n1.put("key1", "value1");
344 Date timestamp = new Date();
345 n1.setTimestamp(timestamp);
346 their.addPrimitive(n1);
347
348 DataSetMerger visitor = new DataSetMerger(my, their);
349 visitor.merge();
350
351 Node n2 = my.getNodes().iterator().next();
352 assertEquals(0, visitor.getConflicts().size());
353 assertEquals("value1", n2.get("key1"));
354 assertEquals(n1.getRawTimestamp(), n2.getRawTimestamp());
355 assertFalse(n2.isIncomplete());
356 assertSame(n2, n);
357 }
358
359 /**
360 * their way has a higher version and different tags. the nodes are the same. My
361 * way is not modified. Merge is possible. No conflict.
362 *
363 * => merge it onto my way.
364 */
365 @Test
366 public void testWaySimpleIdenticalNodesDifferentTags() {
367
368 // -- the target dataset
369
370 Node n1 = new Node();
371 n1.setCoor(LatLon.ZERO);
372 n1.setOsmId(1, 1);
373 my.addPrimitive(n1);
374
375 Node n2 = new Node();
376 n2.setCoor(LatLon.ZERO);
377 n2.setOsmId(2, 1);
378
379 my.addPrimitive(n2);
380
381 Way myWay = new Way();
382 myWay.setOsmId(3, 1);
383 myWay.put("key1", "value1");
384 myWay.addNode(n1);
385 myWay.addNode(n2);
386 my.addPrimitive(myWay);
387
388 // -- the source data set
389
390 Node n3 = new Node(LatLon.ZERO);
391 n3.setOsmId(1, 1);
392 their.addPrimitive(n3);
393
394 Node n4 = new Node(new LatLon(1, 1));
395 n4.setOsmId(2, 1);
396 their.addPrimitive(n4);
397
398 Way theirWay = new Way();
399 theirWay.setOsmId(3, 2);
400 theirWay.put("key1", "value1");
401 theirWay.put("key2", "value2");
402 theirWay.addNode(n3);
403 theirWay.addNode(n4);
404 their.addPrimitive(theirWay);
405
406
407 DataSetMerger visitor = new DataSetMerger(my, their);
408 visitor.merge();
409
410 // -- tests
411 Way merged = (Way) my.getPrimitiveById(3, OsmPrimitiveType.WAY);
412 assertEquals(0, visitor.getConflicts().size());
413 assertEquals("value1", merged.get("key1"));
414 assertEquals("value2", merged.get("key2"));
415 assertEquals(3, merged.getId());
416 assertEquals(2, merged.getVersion());
417 assertEquals(2, merged.getNodesCount());
418 assertEquals(1, merged.getNode(0).getId());
419 assertEquals(2, merged.getNode(1).getId());
420 assertSame(merged, myWay);
421 assertSame(merged.getDataSet(), my);
422
423 Node mergedNode = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
424 assertSame(mergedNode, n1);
425 mergedNode = (Node) my.getPrimitiveById(2, OsmPrimitiveType.NODE);
426 assertSame(mergedNode, n2);
427
428 assertFalse(merged.isModified());
429 }
430
431 /**
432 * their way has a higher version and different tags. And it has more nodes. Two
433 * of the existing nodes are modified.
434 *
435 * => merge it onto my way, no conflict
436 */
437 @Test
438 public void testWaySimpleAdditionalNodesAndChangedNodes() {
439
440 // -- my data set
441
442 Node n1 = new Node(LatLon.ZERO);
443 n1.setOsmId(1, 1);
444 my.addPrimitive(n1);
445
446 Node n2 = new Node(new LatLon(1, 1));
447 n2.setOsmId(2, 1);
448 my.addPrimitive(n2);
449
450 Way myWay = new Way();
451 myWay.setOsmId(3, 1);
452 myWay.addNode(n1);
453 myWay.addNode(n2);
454 my.addPrimitive(myWay);
455
456 // --- their data set
457
458 Node n3 = new Node(LatLon.ZERO);
459 n3.setOsmId(1, 1);
460 their.addPrimitive(n3);
461
462 Node n5 = new Node(new LatLon(1, 1));
463 n5.setOsmId(4, 1);
464
465 their.addPrimitive(n5);
466
467 Node n4 = new Node(new LatLon(2, 2));
468 n4.setOsmId(2, 2);
469 n4.put("key1", "value1");
470 their.addPrimitive(n4);
471
472
473 Way theirWay = new Way();
474 theirWay.setOsmId(3, 2);
475 theirWay.addNode(n3);
476 theirWay.addNode(n5); // insert a node
477 theirWay.addNode(n4); // this one is updated
478 their.addPrimitive(theirWay);
479
480 DataSetMerger visitor = new DataSetMerger(my, their);
481 visitor.merge();
482
483 // -- tests
484 Way merged = (Way) my.getPrimitiveById(3, OsmPrimitiveType.WAY);
485 assertEquals(0, visitor.getConflicts().size());
486 assertEquals(3, merged.getId());
487 assertEquals(2, merged.getVersion());
488 assertEquals(3, merged.getNodesCount());
489 assertEquals(1, merged.getNode(0).getId());
490 assertEquals(4, merged.getNode(1).getId());
491 assertEquals(2, merged.getNode(2).getId());
492 assertEquals("value1", merged.getNode(2).get("key1"));
493
494 assertSame(merged.getNode(0), n1);
495 assertNotSame(merged.getNode(1), n5); // must be clone of the original node in their
496 assertSame(merged.getNode(2), n2);
497
498 assertFalse(merged.isModified()); // the target wasn't modified before merging, it mustn't be after merging
499 }
500
501 /**
502 * their way has a higher version and different nodes. My way is modified.
503 *
504 * => merge onto my way not possible, create a conflict
505 */
506 @Test
507 public void testWaySimpleDifferentNodesAndMyIsModified() {
508
509 // -- the target dataset
510
511 Node n1 = new Node(LatLon.ZERO);
512 n1.setOsmId(1, 1);
513 my.addPrimitive(n1);
514
515 Node n2 = new Node(new LatLon(1, 1));
516 n2.setOsmId(2, 1);
517 my.addPrimitive(n2);
518
519 Way myWay = new Way();
520 myWay.setOsmId(3, 1);
521
522 myWay.addNode(n1);
523 myWay.addNode(n2);
524 myWay.setModified(true);
525 myWay.put("key1", "value1");
526 my.addPrimitive(myWay);
527
528 // -- the source dataset
529
530 Node n3 = new Node(LatLon.ZERO);
531 n3.setOsmId(1, 1);
532 their.addPrimitive(n3);
533
534 Node n5 = new Node(new LatLon(1, 1));
535 n5.setOsmId(4, 1);
536 their.addPrimitive(n5);
537
538 Node n4 = new Node(new LatLon(2, 2));
539 n4.setOsmId(2, 1);
540 n4.put("key1", "value1");
541 their.addPrimitive(n4);
542
543 Way theirWay = new Way();
544 theirWay.setOsmId(3, 2);
545
546 theirWay.addNode(n3);
547 theirWay.addNode(n5); // insert a node
548 theirWay.addNode(n4); // this one is updated
549 their.addPrimitive(theirWay);
550
551
552 DataSetMerger visitor = new DataSetMerger(my, their);
553 visitor.merge();
554
555 Way merged = (Way) my.getPrimitiveById(3, OsmPrimitiveType.WAY);
556 assertEquals(1, visitor.getConflicts().size());
557 assertEquals(3, merged.getId());
558 assertEquals(1, merged.getVersion());
559 assertEquals(2, merged.getNodesCount());
560 assertEquals(1, merged.getNode(0).getId());
561 assertEquals(2, merged.getNode(1).getId());
562 assertEquals("value1", merged.get("key1"));
563 }
564
565 /**
566 * their way is not visible anymore.
567 *
568 * => conflict
569 */
570 @Test
571 public void testWaySimpleTheirVersionNotVisibleMyIsModified() {
572
573 Node mn1 = new Node(LatLon.ZERO);
574 mn1.setOsmId(1, 1);
575 my.addPrimitive(mn1);
576
577 Node mn2 = new Node(new LatLon(1, 1));
578 mn2.setOsmId(2, 1);
579 my.addPrimitive(mn2);
580
581 Way myWay = new Way();
582 myWay.setOsmId(3, 1);
583 myWay.addNode(mn1);
584 myWay.addNode(mn2);
585 myWay.setModified(true);
586 my.addPrimitive(myWay);
587
588 Way theirWay = new Way();
589 theirWay.setOsmId(3, 2);
590 theirWay.setVisible(false);
591 /* Invisible objects fetched from the server should be marked as "deleted".
592 * Otherwise it's an error.
593 */
594 theirWay.setDeleted(true);
595 their.addPrimitive(theirWay);
596
597 DataSetMerger visitor = new DataSetMerger(my, their);
598 visitor.merge();
599
600 Way merged = (Way) my.getPrimitiveById(3, OsmPrimitiveType.WAY);
601 assertEquals(1, visitor.getConflicts().size());
602 assertTrue(visitor.getConflicts().hasConflictForMy(myWay));
603 assertTrue(visitor.getConflicts().hasConflictForTheir(theirWay));
604 assertEquals(myWay, merged);
605 }
606
607 /**
608 * my and their way have no ids, nodes they refer to have an id. but
609 * my and their way are semantically equal. so technical attributes of
610 * their way can be merged on my way. No conflict.
611 */
612 @Test
613 public void testWaySimpleTwoWaysWithNoIdNodesWithId() {
614
615 // -- my data set
616
617 Node n1 = new Node(LatLon.ZERO);
618 n1.setOsmId(1, 1);
619 my.addPrimitive(n1);
620
621 Node n2 = new Node(new LatLon(1, 1));
622 n2.setOsmId(2, 1);
623 my.addPrimitive(n2);
624
625 Way myWay = new Way();
626 myWay.addNode(n1);
627 myWay.addNode(n2);
628 my.addPrimitive(myWay);
629
630 // -- their data set
631
632 Node n3 = new Node(LatLon.ZERO);
633 n3.setOsmId(1, 1);
634 their.addPrimitive(n3);
635
636 Node n4 = new Node(new LatLon(1, 1));
637 n4.setOsmId(2, 1);
638 their.addPrimitive(n4);
639
640 Way theirWay = new Way();
641 theirWay.addNode(n3);
642 theirWay.addNode(n4);
643 User user = User.createOsmUser(1111, "their");
644 theirWay.setUser(user);
645 theirWay.setTimestamp(new Date());
646 their.addPrimitive(theirWay);
647
648 DataSetMerger visitor = new DataSetMerger(my, their);
649 visitor.merge();
650
651 // -- tests
652 Way merged = (Way) my.getWays().toArray()[0];
653 assertEquals(0, visitor.getConflicts().size());
654 assertEquals("their", merged.getUser().getName());
655 assertEquals(1111, merged.getUser().getId());
656 assertEquals(theirWay.getRawTimestamp(), merged.getRawTimestamp());
657 assertSame(merged, myWay);
658 assertSame(merged.getNode(0), n1);
659 assertSame(merged.getNode(1), n2);
660
661 assertFalse(merged.isModified());
662 }
663
664 /**
665 * my and their way have no ids, neither do the nodes they refer to. but
666 * my and their way are semantically equal. so technical attributes of
667 * their way can be merged on my way. No conflict.
668 */
669 @Test
670 public void testWaySimpleTwoWaysWithNoIdNodesWithoutId() {
671
672 // -- my data set
673
674 Node n1 = new Node(LatLon.ZERO);
675 my.addPrimitive(n1);
676
677 Node n2 = new Node(new LatLon(1, 1));
678 my.addPrimitive(n2);
679
680 Way myWay = new Way();
681 myWay.addNode(n1);
682 myWay.addNode(n2);
683 my.addPrimitive(myWay);
684
685 // -- their data set
686
687 Node n3 = new Node(LatLon.ZERO);
688 their.addPrimitive(n3);
689
690 Node n4 = new Node(new LatLon(1, 1));
691 their.addPrimitive(n4);
692
693 Way theirWay = new Way();
694 theirWay.addNode(n3);
695 theirWay.addNode(n4);
696 User user = User.createOsmUser(1111, "their");
697 theirWay.setUser(user);
698 theirWay.setTimestamp(new Date());
699 their.addPrimitive(theirWay);
700
701 DataSetMerger visitor = new DataSetMerger(my, their);
702 visitor.merge();
703
704 // -- tests
705 Way merged = (Way) my.getWays().toArray()[0];
706 assertEquals(0, visitor.getConflicts().size());
707 assertEquals("their", merged.getUser().getName());
708 assertEquals(1111, merged.getUser().getId());
709 assertEquals(theirWay.getRawTimestamp(), merged.getRawTimestamp());
710 assertSame(merged, myWay);
711 assertSame(merged.getNode(0), n1);
712 assertSame(merged.getNode(1), n2);
713
714 assertFalse(merged.isModified());
715 }
716
717 /**
718 * My dataset includes a deleted node.
719 * Their dataset includes a way with three nodes, the first one being my node.
720 *
721 * => the merged way should include all three nodes. Deleted node should have deleted=false and
722 * special conflict with isDeleted should exist
723 */
724 @Test
725 public void testWayComplexMergingADeletedNode() {
726
727 // -- my dataset
728
729 Node mn1 = new Node(LatLon.ZERO);
730 mn1.setOsmId(1, 1);
731 mn1.setDeleted(true);
732 my.addPrimitive(mn1);
733
734 Node tn1 = new Node(LatLon.ZERO);
735 tn1.setOsmId(1, 1);
736 their.addPrimitive(tn1);
737
738 Node tn2 = new Node(new LatLon(1, 1));
739 tn2.setOsmId(2, 1);
740 their.addPrimitive(tn2);
741
742 Node tn3 = new Node(new LatLon(2, 2));
743 tn3.setOsmId(3, 1);
744 their.addPrimitive(tn3);
745
746 // -- their data set
747 Way theirWay = new Way();
748 theirWay.setOsmId(4, 1);
749 theirWay.addNode(tn1);
750 theirWay.addNode(tn2);
751 theirWay.addNode(tn3);
752 theirWay.setUser(User.createOsmUser(1111, "their"));
753 theirWay.setTimestamp(new Date());
754 their.addPrimitive(theirWay);
755
756 DataSetMerger visitor = new DataSetMerger(my, their);
757 visitor.merge();
758
759 assertEquals(1, visitor.getConflicts().size());
760 assertTrue(visitor.getConflicts().get(0).isMyDeleted());
761
762 Way myWay = (Way) my.getPrimitiveById(4, OsmPrimitiveType.WAY);
763 assertEquals(3, myWay.getNodesCount());
764
765 Node n = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
766 assertTrue(myWay.getNodes().contains(n));
767
768 assertFalse(myWay.isModified());
769 }
770
771 /**
772 * My dataset includes a deleted node.
773 * Their dataset includes a relation with three nodes, the first one being my node.
774 *
775 * => the merged relation should include all three nodes. There should be conflict for deleted
776 * node with isMyDeleted set
777 */
778 @Test
779 public void testRelationComplexMergingADeletedNode() {
780
781 Node mn1 = new Node(LatLon.ZERO);
782 mn1.setOsmId(1, 1);
783 mn1.setDeleted(true);
784 my.addPrimitive(mn1);
785
786 Node tn1 = new Node(LatLon.ZERO);
787 tn1.setOsmId(1, 1);
788 their.addPrimitive(tn1);
789
790 Node tn2 = new Node(new LatLon(1, 1));
791 tn2.setOsmId(2, 1);
792 their.addPrimitive(tn2);
793
794 Node tn3 = new Node(new LatLon(2, 2));
795 tn3.setOsmId(3, 1);
796 their.addPrimitive(tn3);
797
798 Relation theirRelation = new Relation();
799 theirRelation.setOsmId(4, 1);
800
801 theirRelation.addMember(new RelationMember("", tn1));
802 theirRelation.addMember(new RelationMember("", tn2));
803 theirRelation.addMember(new RelationMember("", tn3));
804 their.addPrimitive(theirRelation);
805
806 DataSetMerger visitor = new DataSetMerger(my, their);
807 visitor.merge();
808
809 Node n = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
810 assertNotNull(n);
811
812 assertEquals(1, visitor.getConflicts().size());
813 assertTrue(visitor.getConflicts().hasConflictForMy(n));
814 assertTrue(visitor.getConflicts().get(0).isMyDeleted());
815
816 Relation r = (Relation) my.getPrimitiveById(4, OsmPrimitiveType.RELATION);
817 assertEquals(3, r.getMembersCount());
818
819 assertFalse(r.isModified());
820 }
821
822 /**
823 * Merge an incomplete way with two incomplete nodes into an empty dataset.
824 *
825 * Use case: a way loaded with a multiget, i.e. GET /api/0.6/ways?ids=123456
826 */
827 @Test
828 public void testNewIncompleteWay() {
829
830 Node n1 = new Node(1);
831 their.addPrimitive(n1);
832
833 Node n2 = new Node(2);
834 their.addPrimitive(n2);
835
836 Way w3 = new Way(3);
837 w3.setNodes(Arrays.asList(n1, n2));
838 their.addPrimitive(w3);
839 assertTrue(w3.isIncomplete());
840
841 DataSetMerger visitor = new DataSetMerger(my, their);
842 visitor.merge();
843
844 assertEquals(0, visitor.getConflicts().size());
845
846 OsmPrimitive p = my.getPrimitiveById(1, OsmPrimitiveType.NODE);
847 assertNotNull(p);
848 assertTrue(p.isIncomplete());
849 p = my.getPrimitiveById(2, OsmPrimitiveType.NODE);
850 assertNotNull(p);
851 assertTrue(p.isIncomplete());
852 p = my.getPrimitiveById(3, OsmPrimitiveType.WAY);
853 assertNotNull(p);
854 assertTrue(p.isIncomplete());
855
856 Way w = (Way) my.getPrimitiveById(3, OsmPrimitiveType.WAY);
857 assertNotNull(w);
858 assertTrue(p.isIncomplete());
859 assertEquals(2, w.getNodesCount());
860 assertTrue(w.getNode(0).isIncomplete());
861 assertTrue(w.getNode(1).isIncomplete());
862 }
863
864 /**
865 * Merge an incomplete way with two incomplete nodes into a dataset where the way already exists as complete way.
866 *
867 * Use case: a way loaded with a multiget, i.e. GET /api/0.6/ways?ids=123456 after a "Update selection " of this way
868 */
869 @Test
870 public void testIncompleteWayOntoCompleteWay() {
871
872 // an incomplete node
873 Node n1 = new Node(1);
874 their.addPrimitive(n1);
875
876 // another incomplete node
877 Node n2 = new Node(2);
878 their.addPrimitive(n2);
879
880 // an incomplete way with two incomplete nodes
881 Way w3 = new Way(3);
882 w3.setNodes(Arrays.asList(n1, n2));
883 their.addPrimitive(w3);
884
885 Node n4 = new Node(LatLon.ZERO);
886 n4.setOsmId(1, 1);
887 my.addPrimitive(n4);
888
889 Node n5 = new Node(new LatLon(1, 1));
890 n5.setOsmId(2, 1);
891 my.addPrimitive(n5);
892
893 Way w6 = new Way(3, 1);
894 w6.setNodes(Arrays.asList(n4, n5));
895 my.addPrimitive(w6);
896
897 DataSetMerger visitor = new DataSetMerger(my, their);
898 visitor.merge();
899
900 assertEquals(0, visitor.getConflicts().size());
901
902 OsmPrimitive p = my.getPrimitiveById(1, OsmPrimitiveType.NODE);
903 assertNotNull(p);
904 assertFalse(p.isIncomplete());
905 p = my.getPrimitiveById(2, OsmPrimitiveType.NODE);
906 assertNotNull(p);
907 assertFalse(p.isIncomplete());
908 p = my.getPrimitiveById(3, OsmPrimitiveType.WAY);
909 assertNotNull(p);
910 assertFalse(p.isIncomplete());
911
912 Way w = (Way) my.getPrimitiveById(3, OsmPrimitiveType.WAY);
913 assertNotNull(w);
914 assertFalse(p.isIncomplete());
915 assertEquals(2, w.getNodesCount());
916 assertFalse(w.getNode(0).isIncomplete());
917 assertFalse(w.getNode(1).isIncomplete());
918 }
919
920 /**
921 * merge to complete nodes onto an incomplete way with the same two nodes, but incomplete.
922 * => both the nodes and the way should be complete in the target dataset after merging
923 */
924 @Test
925 public void testTwoCompleteNodesOntoAnIncompleteWay() {
926
927 // -- source dataset
928
929 // an complete node
930 Node n1 = new Node(1, 1);
931 n1.setCoor(new LatLon(1, 1));
932 their.addPrimitive(n1);
933
934 // another complete node
935 Node n2 = new Node(2, 1);
936 n2.setCoor(new LatLon(2, 2));
937 their.addPrimitive(n2);
938
939 // --- target dataset
940
941 Node n4 = new Node(1);
942 my.addPrimitive(n4);
943
944 Node n5 = new Node(2);
945 my.addPrimitive(n5);
946
947 Way w6 = new Way(3, 1);
948 w6.addNode(n4);
949 w6.addNode(n5);
950 my.addPrimitive(w6);
951
952 //-- merge it
953 DataSetMerger visitor = new DataSetMerger(my, their);
954 visitor.merge();
955
956 // -- test it
957 assertEquals(0, visitor.getConflicts().size());
958
959 Node n = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
960 assertNotNull(n);
961 assertFalse(n.isIncomplete());
962
963 n = (Node) my.getPrimitiveById(2, OsmPrimitiveType.NODE);
964 assertNotNull(n);
965 assertFalse(n.isIncomplete());
966
967 Way w = (Way) my.getPrimitiveById(3, OsmPrimitiveType.WAY);
968 assertNotNull(w);
969 assertFalse(w.hasIncompleteNodes());
970 assertTrue(w.isUsable());
971 assertEquals(2, w.getNodesCount());
972 assertEquals(1, w.getNode(0).getId());
973 assertEquals(2, w.getNode(1).getId());
974 }
975
976 /**
977 * Non-regression test for <a href="https://josm.openstreetmap.de/ticket/12599">Bug #12599</a>.
978 */
979 @Test
980 public void testTicket12599() {
981 // Server node: no modifications
982 Node n1 = new Node(1, 1);
983 n1.setCoor(LatLon.ZERO);
984 assertFalse(n1.isModified());
985 their.addPrimitive(n1);
986
987 // Local node: one modification: addition of an uninteresting tag
988 Node n1b = new Node(n1);
989 n1b.setModified(true);
990 n1b.put("note", "something");
991 assertTrue(n1b.isModified());
992 assertEquals(0, n1b.getInterestingTags().size());
993 my.addPrimitive(n1b);
994
995 // Merge
996 DataSetMerger visitor = new DataSetMerger(my, their);
997 visitor.merge();
998
999 // Check that modification is still here
1000 Node n = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
1001 assertNotNull(n);
1002 assertEquals("something", n.get("note"));
1003 assertTrue(n.isModified());
1004
1005 // Merge again
1006 visitor = new DataSetMerger(my, their);
1007 visitor.merge();
1008
1009 // Check that modification is still here
1010 n = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
1011 assertNotNull(n);
1012 assertEquals("something", n.get("note"));
1013 assertTrue(n.isModified());
1014 }
1015
1016
1017 /**
1018 * Non-regression test for <a href="https://josm.openstreetmap.de/ticket/12616">Bug #12616</a>.
1019 */
1020 @Test
1021 public void testTicket12616() {
1022 // Server node: no modifications
1023 Node n1 = new Node(1, 1);
1024 n1.setCoor(LatLon.ZERO);
1025 assertFalse(n1.isModified());
1026 their.addPrimitive(n1);
1027
1028 // Local node: one modification: move
1029 Node n1b = new Node(n1);
1030 n1b.setCoor(new LatLon(1, 1));
1031 n1b.setModified(true);
1032 assertTrue(n1b.isModified());
1033 assertEquals(new LatLon(1, 1), n1b.getCoor());
1034 my.addPrimitive(n1b);
1035
1036 // Merge
1037 DataSetMerger visitor = new DataSetMerger(my, their);
1038 visitor.merge();
1039
1040 // Check that modification is still here
1041 Node n = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
1042 assertNotNull(n);
1043 assertEquals(new LatLon(1, 1), n.getCoor());
1044 assertTrue(n.isModified());
1045
1046 // Merge again
1047 visitor = new DataSetMerger(my, their);
1048 visitor.merge();
1049
1050 // Check that modification is still here
1051 n = (Node) my.getPrimitiveById(1, OsmPrimitiveType.NODE);
1052 assertNotNull(n);
1053 assertEquals(new LatLon(1, 1), n.getCoor());
1054 assertTrue(n.isModified());
1055 }
1056}
Note: See TracBrowser for help on using the repository browser.