1 | // License: GPL. Copyright 2007 by Immanuel Scholz and others
|
---|
2 | package org.openstreetmap.josm.data.osm.visitor;
|
---|
3 |
|
---|
4 | import java.util.Collection;
|
---|
5 | import java.util.LinkedList;
|
---|
6 |
|
---|
7 | import org.openstreetmap.josm.data.osm.Node;
|
---|
8 | import org.openstreetmap.josm.data.osm.OsmPrimitive;
|
---|
9 | import org.openstreetmap.josm.data.osm.Segment;
|
---|
10 | import org.openstreetmap.josm.data.osm.Way;
|
---|
11 | import org.openstreetmap.josm.testframework.MotherObject;
|
---|
12 |
|
---|
13 | public class AllNodesVisitorTest extends MotherObject {
|
---|
14 |
|
---|
15 | private AllNodesVisitor v;
|
---|
16 |
|
---|
17 | @Override protected void setUp() throws Exception {
|
---|
18 | super.setUp();
|
---|
19 | v = new AllNodesVisitor();
|
---|
20 | }
|
---|
21 |
|
---|
22 | public void testVisitNode() {
|
---|
23 | Node node = createNode();
|
---|
24 | node.visit(v);
|
---|
25 | assertEquals(1, v.nodes.size());
|
---|
26 | assertSame(node, v.nodes.iterator().next());
|
---|
27 | }
|
---|
28 |
|
---|
29 | public void testVisitSegment() {
|
---|
30 | Segment s = createSegment();
|
---|
31 | s.visit(v);
|
---|
32 | assertEquals(2, v.nodes.size());
|
---|
33 | assertTrue(v.nodes.contains(s.from));
|
---|
34 | assertTrue(v.nodes.contains(s.to));
|
---|
35 | }
|
---|
36 |
|
---|
37 | public void testVisitWay() {
|
---|
38 | Way w = createWay(createSegment());
|
---|
39 | w.visit(v);
|
---|
40 | int numberOfNodes = 2*w.segments.size();
|
---|
41 | assertEquals(numberOfNodes, v.nodes.size());
|
---|
42 | for (Segment s : w.segments) {
|
---|
43 | assertTrue(v.nodes.contains(s.from));
|
---|
44 | assertTrue(v.nodes.contains(s.to));
|
---|
45 | }
|
---|
46 | }
|
---|
47 |
|
---|
48 | public void testGetAllNodes() {
|
---|
49 | Collection<OsmPrimitive> all = new LinkedList<OsmPrimitive>();
|
---|
50 | all.add(createNode());
|
---|
51 | all.add(createSegment());
|
---|
52 | Collection<Node> nodes = AllNodesVisitor.getAllNodes(all);
|
---|
53 |
|
---|
54 | assertEquals(3, nodes.size());
|
---|
55 | }
|
---|
56 |
|
---|
57 | }
|
---|