Changeset 2578 in josm for trunk/test
- Timestamp:
- 2009-12-05T18:23:03+01:00 (15 years ago)
- Location:
- trunk/test
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/test/functional/org/openstreetmap/josm/io/OsmServerBackreferenceReaderTest.java
r2569 r2578 255 255 for (Way way : referers.getWays()) { 256 256 assertEquals(w.getId(), way.getId()); 257 assertEquals(false, way.incomplete); 257 assertEquals(false, way.isIncomplete()); 258 258 } 259 259 } … … 274 274 for (Way way : referers.getWays()) { 275 275 assertEquals(w.getId(), way.getId()); 276 assertEquals(false, way.incomplete); 276 assertEquals(false, way.isIncomplete()); 277 277 assertEquals(10, w.getNodesCount()); 278 278 } … … 292 292 assertEquals(6, referers.getWays().size()); // 6 ways referred by two relations 293 293 for (Way w1 : referers.getWays()) { 294 assertEquals(true, w1.incomplete); 294 assertEquals(true, w1.isIncomplete()); 295 295 } 296 296 assertEquals(2, referers.getRelations().size()); // two relations referring to w … … 298 298 Relation r = lookupRelation(referers, 0); 299 299 assertNotNull(r); 300 assertEquals(false, r.incomplete); 300 assertEquals(false, r.isIncomplete()); 301 301 r = lookupRelation(referers, 1); 302 assertEquals(false, r.incomplete); 302 assertEquals(false, r.isIncomplete()); 303 303 } 304 304 … … 315 315 assertEquals(6, referers.getWays().size()); // 6 ways referred by two relations 316 316 for (Way w1 : referers.getWays()) { 317 assertEquals(false, w1.incomplete); 317 assertEquals(false, w1.isIncomplete()); 318 318 } 319 319 assertEquals(2, referers.getRelations().size()); // two relations referring to … … 332 332 Relation r = lookupRelation(referers, 0); 333 333 assertNotNull(r); 334 assertEquals(false, r.incomplete); 334 assertEquals(false, r.isIncomplete()); 335 335 r = lookupRelation(referers, 1); 336 assertEquals(false, r.incomplete); 336 assertEquals(false, r.isIncomplete()); 337 337 } 338 338 … … 352 352 r = lookupRelation(referers, 6); 353 353 assertNotNull(r); 354 assertEquals(false, r.incomplete); 354 assertEquals(false, r.isIncomplete()); 355 355 referringRelationsIds.add(r.getId()); 356 356 r = lookupRelation(referers, 7); 357 357 assertNotNull(r); 358 assertEquals(false, r.incomplete); 358 assertEquals(false, r.isIncomplete()); 359 359 referringRelationsIds.add(r.getId()); 360 360 r = lookupRelation(referers, 8); 361 361 assertNotNull(r); 362 assertEquals(false, r.incomplete); 362 assertEquals(false, r.isIncomplete()); 363 363 referringRelationsIds.add(r.getId()); 364 364 r = lookupRelation(referers, 9); 365 365 assertNotNull(r); 366 assertEquals(false, r.incomplete); 366 assertEquals(false, r.isIncomplete()); 367 367 referringRelationsIds.add(r.getId()); 368 368 369 369 for (Relation r1 : referers.getRelations()) { 370 370 if (!referringRelationsIds.contains(r1.getId())) { 371 assertEquals(true, r1.incomplete); 371 assertEquals(true, r1.isIncomplete()); 372 372 } 373 373 } … … 401 401 for (Way w1 : referers.getWays()) { 402 402 assertEquals(true, expectedWayIds.contains(w1.getId())); 403 assertEquals(true, w1.incomplete); 403 assertEquals(true, w1.isIncomplete()); 404 404 } 405 405 … … 448 448 r = lookupRelation(referers, 6); 449 449 assertNotNull(r); 450 assertEquals(false, r.incomplete); 450 assertEquals(false, r.isIncomplete()); 451 451 referringRelationsIds.add(r.getId()); 452 452 r = lookupRelation(referers, 7); 453 453 assertNotNull(r); 454 assertEquals(false, r.incomplete); 454 assertEquals(false, r.isIncomplete()); 455 455 referringRelationsIds.add(r.getId()); 456 456 r = lookupRelation(referers, 8); 457 457 assertNotNull(r); 458 assertEquals(false, r.incomplete); 458 assertEquals(false, r.isIncomplete()); 459 459 referringRelationsIds.add(r.getId()); 460 460 r = lookupRelation(referers, 9); 461 461 assertNotNull(r); 462 assertEquals(false, r.incomplete); 462 assertEquals(false, r.isIncomplete()); 463 463 referringRelationsIds.add(r.getId()); 464 464 … … 466 466 // 467 467 for (Relation r1 : referers.getRelations()) { 468 assertEquals(false, r1.incomplete); 468 assertEquals(false, r1.isIncomplete()); 469 469 } 470 470 … … 496 496 Way w = (Way) referers.getPrimitiveById(id, OsmPrimitiveType.WAY); 497 497 assertNotNull(w); 498 assertEquals(false, w.incomplete); 498 assertEquals(false, w.isIncomplete()); 499 499 } 500 500 -
trunk/test/unit/org/openstreetmap/josm/data/osm/APIDataSetTest.java
r2498 r2578 76 76 Relation r4 = new Relation(1); 77 77 r4.put("name", "r4"); 78 r4. incomplete= false;78 r4.setIncomplete(false); 79 79 r4.setModified(true); 80 80 -
trunk/test/unit/org/openstreetmap/josm/data/osm/DataSetMergerTest.java
r2563 r2578 202 202 Node n = new Node(1); 203 203 n.setCoor(new LatLon(0,0)); 204 n. incomplete= false;204 n.setIncomplete(false); 205 205 n.setDeleted(true); 206 206 n.put("key1", "value1"); … … 449 449 n.setCoor(new LatLon(0,0)); 450 450 n.setOsmId(1,1); 451 n. incomplete= true;451 n.setIncomplete(true); 452 452 my.addPrimitive(n); 453 453 … … 470 470 assertEquals("value1",n2.get("key1")); 471 471 assertEquals(true, n1.getTimestamp().equals(n2.getTimestamp())); 472 assertEquals(false, n2.incomplete); 472 assertEquals(false, n2.isIncomplete()); 473 473 assertTrue(n2 == n); 474 474 } … … 1004 1004 w3.setNodes(Arrays.asList(n1,n2)); 1005 1005 source.addPrimitive(w3); 1006 assertTrue(w3.incomplete); 1006 assertTrue(w3.isIncomplete()); 1007 1007 1008 1008 DataSet target = new DataSet(); … … 1016 1016 OsmPrimitive p= target.getPrimitiveById(1, OsmPrimitiveType.NODE); 1017 1017 assertNotNull(p); 1018 assertTrue(p.incomplete); 1018 assertTrue(p.isIncomplete()); 1019 1019 p= target.getPrimitiveById(2, OsmPrimitiveType.NODE); 1020 1020 assertNotNull(p); 1021 assertTrue(p.incomplete); 1021 assertTrue(p.isIncomplete()); 1022 1022 p= target.getPrimitiveById(3, OsmPrimitiveType.WAY); 1023 1023 assertNotNull(p); 1024 assertTrue(p.incomplete); 1024 assertTrue(p.isIncomplete()); 1025 1025 1026 1026 Way w = (Way)target.getPrimitiveById(3, OsmPrimitiveType.WAY); 1027 1027 assertNotNull(w); 1028 assertTrue(p.incomplete); 1028 assertTrue(p.isIncomplete()); 1029 1029 assertEquals(2, w.getNodesCount()); 1030 assertTrue(w.getNode(0).incomplete); 1031 assertTrue(w.getNode(1).incomplete); 1030 assertTrue(w.getNode(0).isIncomplete()); 1031 assertTrue(w.getNode(1).isIncomplete()); 1032 1032 } 1033 1033 … … 1067 1067 1068 1068 Way w6 = new Way(3); 1069 w6. incomplete= false;1069 w6.setIncomplete(false); 1070 1070 w6.setNodes(Arrays.asList(n4,n5)); 1071 1071 my.addPrimitive(w6); … … 1078 1078 OsmPrimitive p= my.getPrimitiveById(1, OsmPrimitiveType.NODE); 1079 1079 assertNotNull(p); 1080 assertTrue(!p.incomplete); 1080 assertTrue(!p.isIncomplete()); 1081 1081 p= my.getPrimitiveById(2, OsmPrimitiveType.NODE); 1082 1082 assertNotNull(p); 1083 assertTrue(!p.incomplete); 1083 assertTrue(!p.isIncomplete()); 1084 1084 p= my.getPrimitiveById(3,OsmPrimitiveType.WAY); 1085 1085 assertNotNull(p); 1086 assertTrue(!p.incomplete); 1086 assertTrue(!p.isIncomplete()); 1087 1087 1088 1088 Way w = (Way)my.getPrimitiveById(3,OsmPrimitiveType.WAY); 1089 1089 assertNotNull(w); 1090 assertTrue(!p.incomplete); 1090 assertTrue(!p.isIncomplete()); 1091 1091 assertEquals(2, w.getNodesCount()); 1092 assertTrue(!w.getNode(0).incomplete); 1093 assertTrue(!w.getNode(1).incomplete); 1092 assertTrue(!w.getNode(0).isIncomplete()); 1093 assertTrue(!w.getNode(1).isIncomplete()); 1094 1094 } 1095 1095 … … 1108 1108 Node n1 = new Node(1); 1109 1109 n1.setCoor(new LatLon(1,1)); 1110 n1. incomplete= false;1110 n1.setIncomplete(false); 1111 1111 source.addPrimitive(n1); 1112 1112 … … 1114 1114 Node n2 = new Node(2); 1115 1115 n2.setCoor(new LatLon(2,2)); 1116 n2. incomplete= false;1116 n2.setIncomplete(false); 1117 1117 source.addPrimitive(n2); 1118 1118 … … 1128 1128 1129 1129 Way w6 = new Way(3); 1130 w6. incomplete= false;1130 w6.setIncomplete(false); 1131 1131 w6.addNode(n4); 1132 1132 w6.addNode(n5); 1133 w6. incomplete= true;1133 w6.setIncomplete(true); 1134 1134 target.addPrimitive(w6); 1135 1135 … … 1143 1143 Node n = (Node)target.getPrimitiveById(1, OsmPrimitiveType.NODE); 1144 1144 assertNotNull(n); 1145 assertFalse(n.incomplete); 1145 assertFalse(n.isIncomplete()); 1146 1146 1147 1147 n = (Node)target.getPrimitiveById(2, OsmPrimitiveType.NODE); 1148 1148 assertNotNull(n); 1149 assertFalse(n.incomplete); 1149 assertFalse(n.isIncomplete()); 1150 1150 1151 1151 Way w = (Way)target.getPrimitiveById(3, OsmPrimitiveType.WAY); 1152 1152 assertNotNull(w); 1153 assertFalse(w.incomplete); 1153 assertFalse(w.isIncomplete()); 1154 1154 assertEquals(2, w.getNodesCount()); 1155 1155 assertEquals(1, w.getNode(0).getId()); -
trunk/test/unit/org/openstreetmap/josm/data/osm/visitor/MergeSourceBuildingVisitorTest.java
r2498 r2578 72 72 Node n2 = new Node(2); 73 73 Way w1 = new Way(3); 74 w1. incomplete= false;74 w1.setIncomplete(false); 75 75 w1.addNode(n1); 76 76 w1.addNode(n2); … … 105 105 Node n2 = new Node(2); 106 106 Way w1 = new Way(3); 107 w1. incomplete= false;107 w1.setIncomplete(false); 108 108 w1.addNode(n1); 109 109 w1.addNode(n2); … … 147 147 assertNotNull(p); 148 148 assertEquals(p.getClass(), Way.class); 149 assertTrue(p.incomplete); 149 assertTrue(p.isIncomplete()); 150 150 } 151 151 … … 156 156 Node n20 = new Node(20); 157 157 r1.addMember(new RelationMember("node-20",n20)); 158 r1. incomplete= false;158 r1.setIncomplete(false); 159 159 Way w30 = new Way(30); 160 w30. incomplete= false;160 w30.setIncomplete(false); 161 161 Node n21; 162 162 w30.addNode(n21 = new Node(21)); … … 217 217 r1.addMember(new RelationMember("node-20",n20)); 218 218 Way w30 = new Way(30); 219 w30. incomplete= false;219 w30.setIncomplete(false); 220 220 Node n21; 221 221 w30.addNode(n21 = new Node(21)); … … 246 246 Way w = (Way)hull.getPrimitiveById(30, OsmPrimitiveType.WAY); 247 247 assertNotNull(w); 248 assertTrue(w.incomplete); 248 assertTrue(w.isIncomplete()); 249 249 250 250 … … 257 257 Relation r = (Relation)hull.getPrimitiveById(40, OsmPrimitiveType.RELATION); 258 258 assertNotNull(r); 259 assertTrue(r.incomplete); 259 assertTrue(r.isIncomplete()); 260 260 261 261 r = (Relation)hull.getPrimitiveById(1, OsmPrimitiveType.RELATION); -
trunk/test/unit/org/openstreetmap/josm/gui/conflict/nodes/NodeListMergeModelTest.java
r2077 r2578 65 65 66 66 Way myWay = new Way(1); 67 myWay. incomplete= false;67 myWay.setIncomplete(false); 68 68 myWay.addNode(new Node(2)); 69 69 myWay.addNode(new Node(3)); … … 90 90 91 91 Way myWay = new Way(1); 92 myWay. incomplete= false;92 myWay.setIncomplete(false); 93 93 myWay.addNode(new Node(2)); 94 94 myWay.addNode(new Node(3)); … … 122 122 123 123 Way myWay = new Way(1); 124 myWay. incomplete= false;124 myWay.setIncomplete(false); 125 125 myWay.addNode(new Node(2)); 126 126 myWay.addNode(new Node(3)); … … 150 150 151 151 Way myWay = new Way(1); 152 myWay. incomplete= false;152 myWay.setIncomplete(false); 153 153 myWay.addNode(new Node(2)); 154 154 myWay.addNode(new Node(3)); … … 179 179 180 180 Way myWay = new Way(1); 181 myWay. incomplete= false;181 myWay.setIncomplete(false); 182 182 myWay.addNode(new Node(2)); 183 183 myWay.addNode(new Node(3)); … … 201 201 202 202 Way myWay = new Way(1); 203 myWay. incomplete= false;203 myWay.setIncomplete(false); 204 204 myWay.addNode(new Node(2)); 205 205 myWay.addNode(new Node(3)); … … 228 228 229 229 Way myWay = new Way(1); 230 myWay. incomplete= false;230 myWay.setIncomplete(false); 231 231 myWay.addNode(new Node(2)); 232 232 myWay.addNode(new Node(3)); … … 256 256 257 257 Way myWay = new Way(1); 258 myWay. incomplete= false;258 myWay.setIncomplete(false); 259 259 myWay.addNode(new Node(2)); 260 260 myWay.addNode(new Node(3)); … … 289 289 290 290 Way myWay = new Way(1); 291 myWay. incomplete= false;291 myWay.setIncomplete(false); 292 292 myWay.addNode(new Node(1)); 293 293 myWay.addNode(new Node(2)); … … 318 318 319 319 Way myWay = new Way(1); 320 myWay. incomplete= false;320 myWay.setIncomplete(false); 321 321 myWay.addNode(new Node(1)); 322 322 myWay.addNode(new Node(2)); … … 347 347 348 348 Way myWay = new Way(1); 349 myWay. incomplete= false;349 myWay.setIncomplete(false); 350 350 myWay.addNode(new Node(1)); 351 351 myWay.addNode(new Node(2)); … … 381 381 382 382 Way myWay = new Way(1); 383 myWay. incomplete= false;383 myWay.setIncomplete(false); 384 384 myWay.addNode(new Node(1)); 385 385 myWay.addNode(new Node(2)); … … 410 410 411 411 Way myWay = new Way(1); 412 myWay. incomplete= false;412 myWay.setIncomplete(false); 413 413 myWay.addNode(new Node(1)); 414 414 myWay.addNode(new Node(2)); … … 441 441 442 442 Way myWay = new Way(1); 443 myWay. incomplete= false;443 myWay.setIncomplete(false); 444 444 myWay.addNode(new Node(1)); 445 445 myWay.addNode(new Node(2)); … … 471 471 472 472 Way myWay = new Way(1); 473 myWay. incomplete= false;473 myWay.setIncomplete(false); 474 474 myWay.addNode(new Node(1)); 475 475 myWay.addNode(new Node(2)); … … 505 505 506 506 Way myWay = new Way(1); 507 myWay. incomplete= false;507 myWay.setIncomplete(false); 508 508 myWay.addNode(new Node(1)); 509 509 myWay.addNode(new Node(2)); … … 532 532 533 533 Way myWay = new Way(1); 534 myWay. incomplete= false;534 myWay.setIncomplete(false); 535 535 myWay.addNode(new Node(1)); 536 536 myWay.addNode(new Node(2)); … … 563 563 564 564 Way myWay = new Way(1); 565 myWay. incomplete= false;565 myWay.setIncomplete(false); 566 566 myWay.addNode(new Node(1)); 567 567 myWay.addNode(new Node(2)); … … 597 597 598 598 Way myWay = new Way(1); 599 myWay. incomplete= false;599 myWay.setIncomplete(false); 600 600 myWay.addNode(new Node(1)); 601 601 myWay.addNode(new Node(2)); … … 624 624 625 625 Way myWay = new Way(1); 626 myWay. incomplete= false;626 myWay.setIncomplete(false); 627 627 myWay.addNode(new Node(1)); 628 628 myWay.addNode(new Node(2)); … … 655 655 656 656 Way myWay = new Way(1); 657 myWay. incomplete= false;657 myWay.setIncomplete(false); 658 658 myWay.addNode(new Node(1)); 659 659 myWay.addNode(new Node(2));
Note:
See TracChangeset
for help on using the changeset viewer.