Changeset 2071 in josm for trunk/test/unit/org
- Timestamp:
- 2009-09-06T23:12:51+02:00 (15 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/test/unit/org/openstreetmap/josm/data/osm/visitor/MergeVisitorTest.java
r1951 r2071 11 11 import java.util.Arrays; 12 12 import java.util.Calendar; 13 import java.util.Collections;14 13 import java.util.Date; 15 14 import java.util.GregorianCalendar; … … 81 80 my.version = "0.6"; 82 81 Node n = new Node(new LatLon(0,0)); 83 n.id = 1; 84 n.version = 1; 85 n.modified = false; 82 n.setOsmId(1,1); 83 n.setModified(false); 86 84 n.put("key1", "value1"); 87 85 my.addPrimitive(n); … … 90 88 their.version = "0.6"; 91 89 Node n1 = new Node(new LatLon(0,0)); 92 n1.id = 1; 93 n1.version = 1; 94 n1.modified = false; 90 n1.setOsmId(1,1); 91 n1.setModified(false); 95 92 n1.put("key1", "value1"); 96 93 their.addPrimitive(n1); … … 102 99 Node n2 = (Node)my.getPrimitiveById(1); 103 100 assertTrue(visitor.getConflicts().isEmpty()); 104 assertEquals(1, n2. id);105 assertEquals(1, n2. version);106 assertEquals(false, n2. modified);101 assertEquals(1, n2.getId()); 102 assertEquals(1, n2.getVersion()); 103 assertEquals(false, n2.isModified()); 107 104 assertEquals("value1", n2.get("key1")); 108 105 } … … 118 115 my.version = "0.6"; 119 116 Node n = new Node(new LatLon(0,0)); 120 n.id = 1; 121 n.version = 1; 122 n.modified = false; 117 n.setOsmId(1,1); 118 n.setModified(false); 123 119 n.put("key1", "value1"); 124 120 my.addPrimitive(n); … … 127 123 their.version = "0.6"; 128 124 Node n1 = new Node(new LatLon(0,0)); 129 n1.id = 1; 130 n1.version = 2; 131 n1.modified = false; 125 n1.setOsmId(1,2); 126 n1.setModified(false); 132 127 n1.put("key1", "value1-new"); 133 128 n1.put("key2", "value2"); … … 140 135 Node n2 = (Node)my.getPrimitiveById(1); 141 136 assertTrue(visitor.getConflicts().isEmpty()); 142 assertEquals(1, n2. id);143 assertEquals(2, n2. version);144 assertEquals(false, n2. modified);137 assertEquals(1, n2.getId()); 138 assertEquals(2, n2.getVersion()); 139 assertEquals(false, n2.isModified()); 145 140 assertEquals("value1-new", n2.get("key1")); 146 141 assertEquals("value2", n2.get("key2")); … … 159 154 my.version = "0.6"; 160 155 Node n = new Node(new LatLon(0,0)); 161 n.id = 1; 162 n.version = 1; 163 n.modified = true; 156 n.setOsmId(1,1); 157 n.setModified(true); 164 158 n.put("key1", "value1"); 165 159 n.put("key2", "value2"); … … 169 163 their.version = "0.6"; 170 164 Node n1 = new Node(new LatLon(0,0)); 171 n1.id = 1; 172 n1.version = 2; 173 n1.modified = false; 165 n1.setOsmId(1,2); 166 n1.setModified(false); 174 167 n1.put("key1", "value1-new"); 175 168 … … 196 189 DataSet my = new DataSet(); 197 190 my.version = "0.6"; 198 Node n = new Node(new LatLon(0,0)); 199 n.id = 1; 200 n.delete(true); 191 Node n = new Node(1); 192 n.setCoor(new LatLon(0,0)); 193 n.incomplete = false; 194 n.setDeleted(true); 201 195 n.put("key1", "value1"); 202 196 my.addPrimitive(n); … … 205 199 their.version = "0.6"; 206 200 Node n1 = new Node(new LatLon(0,0)); 207 n1.id = 1; 208 n1.version = 2; 209 n1.modified = false; 201 n1.setOsmId(1,1); 202 n1.setModified(false); 210 203 n1.put("key1", "value1-new"); 211 204 n1.put("key2", "value2"); … … 231 224 my.version = "0.6"; 232 225 Node n = new Node(new LatLon(0,0)); 233 n.id = 1; 234 n.version = 1; 235 n.modified = false; 236 n.visible = true; 226 n.setOsmId(1,1); 227 n.setModified(false); 228 n.setVisible(true); 237 229 my.addPrimitive(n); 238 230 … … 240 232 their.version = "0.6"; 241 233 Node n1 = new Node(new LatLon(0,0)); 242 n1. id = 1;243 n1.version = 2; 244 n1. modified = false;245 n1. visible = false;234 n1.setOsmId(1,2); 235 236 n1.setModified(false); 237 n1.setVisible(false); 246 238 their.addPrimitive(n1); 247 239 … … 252 244 Node n2 = (Node)my.getPrimitiveById(1); 253 245 assertEquals(1,visitor.getConflicts().size()); 254 assertEquals(true, n2. visible);246 assertEquals(true, n2.isVisible()); 255 247 } 256 248 … … 265 257 my.version = "0.6"; 266 258 Node n = new Node(new LatLon(0,0)); 267 n.id = 1; 268 n.version = 1; 269 n.delete(true); 259 n.setOsmId(1,1); 260 n.setDeleted(true); 270 261 my.addPrimitive(n); 271 262 … … 273 264 their.version = "0.6"; 274 265 Node n1 = new Node(new LatLon(0,0)); 275 n1.id = 1; 276 n1.version = 1; 266 n1.setOsmId(1,1); 277 267 their.addPrimitive(n1); 278 268 … … 283 273 Node n2 = (Node)my.getPrimitiveById(1); 284 274 assertEquals(0,visitor.getConflicts().size()); 285 assertEquals(true, n2. visible);275 assertEquals(true, n2.isVisible()); 286 276 } 287 277 … … 297 287 my.version = "0.6"; 298 288 Node n = new Node(new LatLon(1,1)); 299 n.id = 0; 300 n.delete(true); 289 n.setDeleted(true); 301 290 my.addPrimitive(n); 302 291 … … 304 293 their.version = "0.6"; 305 294 Node n1 = new Node(new LatLon(1,1)); 306 n1.id = 0;307 295 their.addPrimitive(n1); 308 296 … … 325 313 my.version = "0.6"; 326 314 Node n = new Node(new LatLon(1,1)); 327 n.id = 0; 328 n.delete(true); 315 n.setDeleted(true); 329 316 my.addPrimitive(n); 330 317 … … 332 319 their.version = "0.6"; 333 320 Node n1 = new Node(new LatLon(1,1)); 334 n1.id = 0; 335 n1.delete(true); 321 n1.setDeleted(true); 336 322 their.addPrimitive(n1); 337 323 … … 353 339 my.version = "0.6"; 354 340 Node n = new Node(new LatLon(0,0)); 355 n.id = 1; 356 n.version = 1; 357 n.delete(true); 341 n.setOsmId(1,1); 342 n.setDeleted(true); 358 343 my.addPrimitive(n); 359 344 … … 361 346 their.version = "0.6"; 362 347 Node n1 = new Node(new LatLon(0,0)); 363 n1.id = 2; 364 n1.version = 1; 365 n1.visible = false; 348 n1.setOsmId(2,1); 349 n1.setVisible(false); 366 350 their.addPrimitive(n1); 367 351 … … 387 371 388 372 Calendar cal = GregorianCalendar.getInstance(); 389 User myUser = User.get("my"); 390 myUser.uid = "1111"; 391 392 User theirUser = User.get("their"); 393 myUser.uid = "222"; 394 395 DataSet my = new DataSet(); 396 my.version = "0.6"; 397 Node n = new Node(new LatLon(0,0)); 398 n.id = 0; 399 n.version = -1; 373 User myUser = User.createOsmUser(1111, "my"); 374 375 User theirUser = User.createOsmUser(222, "their"); 376 377 DataSet my = new DataSet(); 378 my.version = "0.6"; 379 Node n = new Node(); 380 n.setCoor(new LatLon(0,0)); 400 381 n.put("key1", "value1"); 401 382 n.user = myUser; … … 406 387 DataSet their = new DataSet(); 407 388 their.version = "0.6"; 408 Node n1 = new Node(new LatLon(0,0)); 409 n1.id = 0; 410 n1.version = -1; 389 Node n1 = new Node(); 390 n1.setCoor(new LatLon(0,0)); 411 391 n1.put("key1", "value1"); 412 392 cal.add(Calendar.HOUR, 1); … … 438 418 DataSet my = new DataSet(); 439 419 my.version = "0.6"; 440 Node n = new Node( new LatLon(0,0));441 n. id = 1;442 n. version = 1;420 Node n = new Node(); 421 n.setCoor(new LatLon(0,0)); 422 n.setOsmId(1,1); 443 423 n.incomplete = true; 444 424 my.addPrimitive(n); … … 446 426 DataSet their = new DataSet(); 447 427 their.version = "0.6"; 448 Node n1 = new Node( new LatLon(0,0));449 n1. id = 1;450 n1. version = 1;428 Node n1 = new Node(); 429 n1.setCoor(new LatLon(0,0)); 430 n1.setOsmId(1,1); 451 431 n1.put("key1", "value1"); 452 432 Date timestamp = new Date(); … … 479 459 my.version = "0.6"; 480 460 481 Node n1 = new Node( new LatLon(0,0));482 n1. id = 1;483 n1. version = 1;461 Node n1 = new Node(); 462 n1.setCoor(new LatLon(0,0)); 463 n1.setOsmId(1,1); 484 464 my.addPrimitive(n1); 485 465 486 Node n2 = new Node(new LatLon(1,1)); 487 n2.id = 2; 488 n2.version = 1; 466 467 Node n2 = new Node(); 468 n2.setCoor(new LatLon(0,0)); 469 n2.setOsmId(2,1); 470 489 471 my.addPrimitive(n2); 490 472 491 473 Way myWay = new Way(); 492 myWay.id = 3; 493 myWay.version = 1; 474 myWay.setOsmId(3,1); 494 475 myWay.put("key1", "value1"); 495 476 myWay.addNode(n1); … … 501 482 502 483 Node n3 = new Node(new LatLon(0,0)); 503 n3.id = 1; 504 n3.version = 1; 484 n3.setOsmId(1,1); 505 485 their.addPrimitive(n3); 506 486 507 487 Node n4 = new Node(new LatLon(1,1)); 508 n4.id = 2; 509 n4.version = 1; 488 n4.setOsmId(2,1); 510 489 their.addPrimitive(n4); 511 490 512 491 Way theirWay = new Way(); 513 theirWay.id = 3; 514 theirWay.version = 2; 492 theirWay.setOsmId(3,2); 515 493 theirWay.put("key1", "value1"); 516 494 theirWay.put("key2", "value2"); … … 527 505 assertEquals("value1",merged.get("key1")); 528 506 assertEquals("value2",merged.get("key2")); 529 assertEquals(3,merged. id);530 assertEquals(2,merged. version);507 assertEquals(3,merged.getId()); 508 assertEquals(2,merged.getVersion()); 531 509 assertEquals(2,merged.getNodesCount()); 532 assertEquals(1,merged.getNode(0). id);533 assertEquals(2,merged.getNode(1). id);510 assertEquals(1,merged.getNode(0).getId()); 511 assertEquals(2,merged.getNode(1).getId()); 534 512 535 513 } … … 549 527 550 528 Node n1 = new Node(new LatLon(0,0)); 551 n1.id = 1; 552 n1.version = 1; 529 n1.setOsmId(1,1); 553 530 my.addPrimitive(n1); 554 531 555 532 Node n2 = new Node(new LatLon(1,1)); 556 n2.id = 2; 557 n2.version = 1; 533 n2.setOsmId(2,1); 558 534 my.addPrimitive(n2); 559 535 560 536 Way myWay = new Way(); 561 myWay.id = 3; 562 myWay.version = 1; 537 myWay.setOsmId(3,1); 563 538 myWay.addNode(n1); 564 539 myWay.addNode(n2); … … 569 544 570 545 Node n3 = new Node(new LatLon(0,0)); 571 n3.id = 1; 572 n3.version = 1; 546 n3.setOsmId(1,1); 573 547 their.addPrimitive(n3); 574 548 575 549 Node n5 = new Node(new LatLon(1,1)); 576 n5. id = 4;577 n5.version = 1; 550 n5.setOsmId(4,1); 551 578 552 their.addPrimitive(n5); 579 553 … … 581 555 582 556 Node n4 = new Node(new LatLon(2,2)); 583 n4.id = 2; 584 n4.version = 2; 557 n4.setOsmId(2,2); 585 558 n4.put("key1", "value1"); 586 559 their.addPrimitive(n4); … … 588 561 589 562 Way theirWay = new Way(); 590 theirWay.id = 3; 591 theirWay.version = 2; 563 theirWay.setOsmId(3,2); 592 564 theirWay.addNode(n3); 593 565 theirWay.addNode(n5); // insert a node … … 601 573 Way merged = (Way)my.getPrimitiveById(3); 602 574 assertEquals(0,visitor.getConflicts().size()); 603 assertEquals(3,merged. id);604 assertEquals(2,merged. version);575 assertEquals(3,merged.getId()); 576 assertEquals(2,merged.getVersion()); 605 577 assertEquals(3,merged.getNodesCount()); 606 assertEquals(1,merged.getNode(0). id);607 assertEquals(4,merged.getNode(1). id);608 assertEquals(2,merged.getNode(2). id);578 assertEquals(1,merged.getNode(0).getId()); 579 assertEquals(4,merged.getNode(1).getId()); 580 assertEquals(2,merged.getNode(2).getId()); 609 581 assertEquals("value1",merged.getNode(2).get("key1")); 610 582 } … … 623 595 624 596 Node n1 = new Node(new LatLon(0,0)); 625 n1.id = 1; 626 n1.version = 1; 597 n1.setOsmId(1,1); 627 598 my.addPrimitive(n1); 628 599 629 600 Node n2 = new Node(new LatLon(1,1)); 630 n2.id = 2; 631 n2.version = 1; 601 n2.setOsmId(2,1); 632 602 my.addPrimitive(n2); 633 603 634 604 Way myWay = new Way(); 635 myWay. id = 3;636 myWay.version = 1; 605 myWay.setOsmId(3,1); 606 637 607 myWay.addNode(n1); 638 608 myWay.addNode(n2); 639 myWay. modified = true;609 myWay.setModified(true); 640 610 myWay.put("key1", "value1"); 641 611 my.addPrimitive(myWay); … … 645 615 646 616 Node n3 = new Node(new LatLon(0,0)); 647 n3.id = 1; 648 n3.version = 1; 617 n3.setOsmId(1,1); 649 618 their.addPrimitive(n3); 650 619 651 620 Node n5 = new Node(new LatLon(1,1)); 652 n5.id = 4; 653 n5.version = 1; 621 n5.setOsmId(4,1); 654 622 their.addPrimitive(n5); 655 623 … … 657 625 658 626 Node n4 = new Node(new LatLon(2,2)); 659 n4.id = 2; 660 n4.version = 2; 627 n4.setOsmId(2,1); 661 628 n4.put("key1", "value1"); 662 629 their.addPrimitive(n4); … … 664 631 665 632 Way theirWay = new Way(); 666 theirWay. id = 3;667 theirWay.version = 2; 633 theirWay.setOsmId(3,2); 634 668 635 theirWay.addNode(n3); 669 636 theirWay.addNode(n5); // insert a node … … 677 644 Way merged = (Way)my.getPrimitiveById(3); 678 645 assertEquals(1,visitor.getConflicts().size()); 679 assertEquals(3,merged. id);680 assertEquals(1,merged. version);646 assertEquals(3,merged.getId()); 647 assertEquals(1,merged.getVersion()); 681 648 assertEquals(2,merged.getNodesCount()); 682 assertEquals(1,merged.getNode(0). id);683 assertEquals(2,merged.getNode(1). id);649 assertEquals(1,merged.getNode(0).getId()); 650 assertEquals(2,merged.getNode(1).getId()); 684 651 assertEquals("value1",merged.get("key1")); 685 652 } … … 699 666 700 667 Node n1 = new Node(new LatLon(0,0)); 701 n1.id = 1; 702 n1.version = 1; 668 n1.setOsmId(1,1); 703 669 my.addPrimitive(n1); 704 670 705 671 Node n2 = new Node(new LatLon(1,1)); 706 n2.id = 2; 707 n2.version = 1; 672 n2.setOsmId(2,1); 708 673 my.addPrimitive(n2); 709 674 710 675 Way myWay = new Way(); 711 myWay.id = 3; 712 myWay.version = 1; 676 myWay.setOsmId(3,1); 713 677 myWay.addNode(n1); 714 678 myWay.addNode(n2); … … 719 683 720 684 Way theirWay = new Way(); 721 theirWay.id = 3; 722 theirWay.version = 2; 723 theirWay.visible = false; 685 theirWay.setOsmId(3,2); 686 theirWay.setVisible(false); 724 687 their.addPrimitive(theirWay); 725 688 … … 749 712 750 713 Node n1 = new Node(new LatLon(0,0)); 751 n1.id = 1; 752 n1.version = 1; 714 n1.setOsmId(1,1); 753 715 my.addPrimitive(n1); 754 716 755 717 Node n2 = new Node(new LatLon(1,1)); 756 n2.id = 2; 757 n2.version = 1; 718 n2.setOsmId(2,1); 758 719 my.addPrimitive(n2); 759 720 760 721 Way myWay = new Way(); 761 myWay.id = 0;762 myWay.version = -1;763 722 myWay.addNode(n1); 764 723 myWay.addNode(n2); … … 769 728 770 729 Node n3 = new Node(new LatLon(0,0)); 771 n3.id = 1; 772 n3.version = 1; 730 n3.setOsmId(1,1); 773 731 their.addPrimitive(n3); 774 732 775 733 Node n4 = new Node(new LatLon(1,1)); 776 n4.id = 2; 777 n4.version = 1; 734 n4.setOsmId(2,1); 778 735 their.addPrimitive(n4); 779 736 780 737 Way theirWay = new Way(); 781 theirWay.id = 0;782 theirWay.version = -1;783 738 theirWay.addNode(n3); 784 739 theirWay.addNode(n4); 785 theirWay.user = User.get("their"); 786 theirWay.user.uid = "1111"; 740 theirWay.user = User.createOsmUser(1111, "their"); 787 741 theirWay.setTimestamp(new Date()); 788 742 their.addPrimitive(theirWay); … … 792 746 793 747 assertEquals(0,visitor.getConflicts().size()); 794 assertEquals("their", myWay.user. name);795 assertEquals( "1111", myWay.user.uid);796 assertEquals( "1111", myWay.user.uid);748 assertEquals("their", myWay.user.getName()); 749 assertEquals(1111, myWay.user.getId()); 750 assertEquals(1111, myWay.user.getId()); 797 751 assertEquals(theirWay.getTimestamp(), myWay.getTimestamp()); 798 752 } … … 811 765 812 766 Node n1 = new Node(new LatLon(0,0)); 813 n1.id = 0;814 n1.version = -1;815 767 my.addPrimitive(n1); 816 768 817 769 Node n2 = new Node(new LatLon(1,1)); 818 n2.id = 0;819 n2.version = -1;820 770 my.addPrimitive(n2); 821 771 822 772 Way myWay = new Way(); 823 myWay.id = 0;824 myWay.version = -1;825 773 myWay.addNode(n1); 826 774 myWay.addNode(n2); … … 831 779 832 780 Node n3 = new Node(new LatLon(0,0)); 833 n3.id = 0;834 n3.version = -1;835 781 their.addPrimitive(n3); 836 782 837 783 Node n4 = new Node(new LatLon(1,1)); 838 n4.id = 0;839 n4.version = -1;840 784 their.addPrimitive(n4); 841 785 842 786 Way theirWay = new Way(); 843 theirWay.id = 0;844 theirWay.version = -1;845 787 theirWay.addNode(n3); 846 788 theirWay.addNode(n4); 847 theirWay.user = User.get("their"); 848 theirWay.user.uid = "1111"; 789 theirWay.user = User.createOsmUser(1111, "their"); 849 790 theirWay.setTimestamp(new Date()); 850 791 their.addPrimitive(theirWay); … … 854 795 855 796 assertEquals(0,visitor.getConflicts().size()); 856 assertEquals("their", myWay.user. name);857 assertEquals( "1111", myWay.user.uid);858 assertEquals( "1111", myWay.user.uid);797 assertEquals("their", myWay.user.getName()); 798 assertEquals(1111, myWay.user.getId()); 799 assertEquals(1111, myWay.user.getId()); 859 800 assertEquals(theirWay.getTimestamp(), myWay.getTimestamp()); 860 801 } … … 876 817 877 818 Node n1 = new Node(new LatLon(0,0)); 878 n1.id = 1; 879 n1.version = 1; 880 n1.delete(true); 819 n1.setOsmId(1,1); 820 n1.setDeleted(true); 881 821 my.addPrimitive(n1); 882 822 … … 885 825 886 826 Node n3 = new Node(new LatLon(0,0)); 887 n3.id = 1; 888 n3.version = 1; 827 n3.setOsmId(1,1); 889 828 their.addPrimitive(n3); 890 829 891 830 Node n4 = new Node(new LatLon(1,1)); 892 n4.id = 2; 893 n4.version = 1; 831 n4.setOsmId(2,1); 894 832 their.addPrimitive(n4); 895 833 896 834 Node n5 = new Node(new LatLon(2,2)); 897 n5.id = 3; 898 n5.version = 1; 835 n5.setOsmId(3,1); 899 836 their.addPrimitive(n5); 900 837 901 838 902 839 Way theirWay = new Way(); 903 theirWay.id = 4; 904 theirWay.version = 1; 840 theirWay.setOsmId(4,1); 905 841 theirWay.addNode(n3); 906 842 theirWay.addNode(n4); 907 843 theirWay.addNode(n5); 908 theirWay.user = User.get("their"); 909 theirWay.user.uid = "1111"; 844 theirWay.user = User.createOsmUser(1111, "their"); 910 845 theirWay.setTimestamp(new Date()); 911 846 their.addPrimitive(theirWay); … … 938 873 939 874 Node n1 = new Node(new LatLon(0,0)); 940 n1.id = 1; 941 n1.version = 1; 942 n1.delete(true); 875 n1.setOsmId(1,1); 876 n1.setDeleted(true); 943 877 my.addPrimitive(n1); 944 878 … … 947 881 948 882 Node n3 = new Node(new LatLon(0,0)); 949 n3.id = 1; 950 n3.version = 1; 883 n3.setOsmId(1,1); 951 884 their.addPrimitive(n3); 952 885 953 886 Node n4 = new Node(new LatLon(1,1)); 954 n4.id = 2; 955 n4.version = 1; 887 n4.setOsmId(2,1); 956 888 their.addPrimitive(n4); 957 889 958 890 Node n5 = new Node(new LatLon(2,2)); 959 n5.id = 3; 960 n5.version = 1; 891 n5.setOsmId(3,1); 961 892 their.addPrimitive(n5); 962 893 963 894 964 895 Relation theirRelation = new Relation(); 965 theirRelation. id = 4;966 theirRelation.version = 1; 896 theirRelation.setOsmId(4,1); 897 967 898 theirRelation.addMember(new RelationMember("", n3)); 968 899 theirRelation.addMember(new RelationMember("", n4)); … … 993 924 994 925 Node n1 = new Node(1); 995 n1.version = 1;996 n1.incomplete = true;997 926 their.addPrimitive(n1); 998 927 999 928 Node n2 = new Node(2); 1000 n2.version = 1;1001 n2.incomplete = true;1002 929 their.addPrimitive(n2); 1003 930 … … 1043 970 their.version = "0.6"; 1044 971 972 // an incomplete node 1045 973 Node n1 = new Node(1); 1046 n1.version = 1; 1047 n1.incomplete = true; 1048 their.addPrimitive(n1); 1049 974 their.addPrimitive(n1); 975 976 // another incomplete node 1050 977 Node n2 = new Node(2); 1051 n2.version = 1;1052 n2.incomplete = true;1053 978 their.addPrimitive(n2); 1054 979 980 // an incomplete way with two incomplete nodes 1055 981 Way w3 = new Way(3); 1056 982 w3.incomplete = true; … … 1062 988 1063 989 Node n4 = new Node(new LatLon(0,0)); 1064 n4.id = 1; 1065 n4.version = 1; 1066 n4.incomplete = false; 990 n4.setOsmId(1,1); 1067 991 my.addPrimitive(n4); 1068 992 1069 993 Node n5 = new Node(new LatLon(1,1)); 1070 n5.id = 2; 1071 n5.version = 1; 1072 n5.incomplete = false; 994 n5.setOsmId(2,1); 1073 995 my.addPrimitive(n5); 1074 996
Note:
See TracChangeset
for help on using the changeset viewer.