1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
/*******************************************************************************
* Copyright (c) 2005, 2009 Oracle. All rights reserved.
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License v1.0, which accompanies this distribution
* and is available at http://www.eclipse.org/legal/epl-v10.html.
*
* Contributors:
* Oracle - initial API and implementation
******************************************************************************/
package org.eclipse.jpt.utility.tests.internal.iterators;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;
import junit.framework.TestCase;
import org.eclipse.jpt.utility.internal.CollectionTools;
import org.eclipse.jpt.utility.internal.iterators.GraphIterator;
import org.eclipse.jpt.utility.tests.internal.TestTools;
@SuppressWarnings("nls")
public class GraphIteratorTests extends TestCase {
/** this will be populated with all the nodes created for the test */
Collection<GraphNode> nodes = new ArrayList<GraphNode>();
public GraphIteratorTests(String name) {
super(name);
}
@Override
protected void tearDown() throws Exception {
TestTools.clear(this);
super.tearDown();
}
public void testHasNext1() {
this.verifyHasNext(this.buildGraphIterator1());
}
public void testHasNext2() {
this.verifyHasNext(this.buildGraphIterator2());
}
private void verifyHasNext(Iterator<GraphNode> iterator) {
int i = 0;
while (iterator.hasNext()) {
iterator.next();
i++;
}
assertEquals(this.nodes.size(), i);
}
public void testNext1() {
this.verifyNext(this.buildGraphIterator1());
}
public void testNext2() {
this.verifyNext(this.buildGraphIterator2());
}
private void verifyNext(Iterator<GraphNode> iterator) {
while (iterator.hasNext()) {
assertTrue("bogus element", this.nodes.contains(iterator.next()));
}
}
public void testNoSuchElementException1() {
this.verifyNoSuchElementException(this.buildGraphIterator1());
}
public void testNoSuchElementException2() {
this.verifyNoSuchElementException(this.buildGraphIterator2());
}
private void verifyNoSuchElementException(Iterator<GraphNode> iterator) {
boolean exCaught = false;
while (iterator.hasNext()) {
iterator.next();
}
try {
iterator.next();
} catch (NoSuchElementException ex) {
exCaught = true;
}
assertTrue("NoSuchElementException not thrown", exCaught);
}
public void testSize1() {
this.verifySize(this.buildGraphIterator1());
}
public void testSize2() {
this.verifySize(this.buildGraphIterator2());
}
private void verifySize(Iterator<GraphNode> iterator) {
int iteratorSize = CollectionTools.size(iterator);
int actualSize = this.nodes.size();
assertTrue("Too few items in iterator.", iteratorSize >= actualSize);
assertTrue("Too many items in iterator.", iteratorSize <= actualSize);
}
public void testInvalidGraphIterator() {
boolean exCaught = false;
try {
// missing method override
Iterator<GraphNode> iterator = new GraphIterator<GraphNode>(this.buildGraphRoot());
GraphNode gn = iterator.next();
fail("invalid graph node: " + gn);
} catch (UnsupportedOperationException ex) {
exCaught = true;
}
assertTrue("NoSuchElementException not thrown", exCaught);
}
/**
* build a graph iterator with an explicit misterRogers
*/
private Iterator<GraphNode> buildGraphIterator1() {
return new GraphIterator<GraphNode>(this.buildGraphRoot(), this.buildMisterRogers());
}
private GraphIterator.MisterRogers<GraphNode> buildMisterRogers() {
return new GraphIterator.MisterRogers<GraphNode>() {
public Iterator<GraphNode> neighbors(GraphNode next) {
return next.neighbors();
}
};
}
/**
* build a graph iterator with an override
*/
private Iterator<GraphNode> buildGraphIterator2() {
return new GraphIterator<GraphNode>(this.buildGraphRoot()) {
@Override
public Iterator<GraphNode> neighbors(GraphNode next) {
return next.neighbors();
}
};
}
private GraphNode buildGraphRoot() {
GraphNode ncNode = new GraphNode("North Carolina");
GraphNode vaNode = new GraphNode("Virginia");
GraphNode scNode = new GraphNode("South Carolina");
GraphNode gaNode = new GraphNode("Georgia");
GraphNode flNode = new GraphNode("Florida");
GraphNode alNode = new GraphNode("Alabama");
GraphNode msNode = new GraphNode("Mississippi");
GraphNode tnNode = new GraphNode("Tennessee");
ncNode.setNeighbors(new GraphNode[] { vaNode, scNode, gaNode, tnNode });
vaNode.setNeighbors(new GraphNode[] { ncNode, tnNode });
scNode.setNeighbors(new GraphNode[] { ncNode, gaNode });
gaNode.setNeighbors(new GraphNode[] { ncNode, scNode, flNode, alNode, tnNode });
flNode.setNeighbors(new GraphNode[] { gaNode });
alNode.setNeighbors(new GraphNode[] { gaNode, msNode, tnNode });
msNode.setNeighbors(new GraphNode[] { alNode, tnNode });
tnNode.setNeighbors(new GraphNode[] { vaNode, ncNode, gaNode, alNode, msNode });
return ncNode;
}
public class GraphNode {
private String name;
private Collection<GraphNode> neighbors = new ArrayList<GraphNode>();
public GraphNode(String name) {
super();
GraphIteratorTests.this.nodes.add(this); // log node
this.name = name;
}
public String getName() {
return this.name;
}
void setNeighbors(GraphNode[] neighbors) {
this.neighbors = CollectionTools.list(neighbors);
}
public Iterator<GraphNode> neighbors() {
return this.neighbors.iterator();
}
public int neighborsSize() {
return this.neighbors.size();
}
@Override
public String toString() {
return "GraphNode(" + this.name + ")";
}
}
}
|
