summaryrefslogtreecommitdiff
path: root/source/com/c2kernel/graph/traversal/GraphTraversal.java
diff options
context:
space:
mode:
authorabranson <andrew.branson@cern.ch>2011-08-04 00:42:34 +0200
committerabranson <andrew.branson@cern.ch>2011-08-04 00:42:34 +0200
commit0ec8481c10cd8277d84c7c1a785483a0a739e5a0 (patch)
tree5f6e5d9ae75193e67e6f3b3dfa488960c5cde1d5 /source/com/c2kernel/graph/traversal/GraphTraversal.java
parent036cbdba66f804743c4c838ed598d6972c4b3e17 (diff)
More code cleanup:
Refactored Entity Proxy Subscription to handle generics better Rewrote RemoteMap to use TreeMap instead of the internal array for order. It now sorts its keys by number if they parse, else as strings. Removed a no-longer-in-progress outcome form class
Diffstat (limited to 'source/com/c2kernel/graph/traversal/GraphTraversal.java')
-rw-r--r--source/com/c2kernel/graph/traversal/GraphTraversal.java8
1 files changed, 4 insertions, 4 deletions
diff --git a/source/com/c2kernel/graph/traversal/GraphTraversal.java b/source/com/c2kernel/graph/traversal/GraphTraversal.java
index b50030d..0d9c819 100644
--- a/source/com/c2kernel/graph/traversal/GraphTraversal.java
+++ b/source/com/c2kernel/graph/traversal/GraphTraversal.java
@@ -55,8 +55,8 @@ public class GraphTraversal
((vertex.isJoin() && direction == kUp) ||
(vertex.isLoop() && direction == kDown))) {
Vertex[] following = getTraversal(graphModel, children[i], direction, false);
- for (int j = 0; j < following.length; j++) {
- if (following[j] == vertex) {
+ for (Vertex element : following) {
+ if (element == vertex) {
skipBackLink = true;
break;
}
@@ -69,7 +69,7 @@ public class GraphTraversal
}
- private static Vertex[] vectorToVertexArray(Vector vector)
+ private static Vertex[] vectorToVertexArray(Vector<Vertex> vector)
{
Vertex[] vertices = new Vertex[vector.size()];
int i = 0;
@@ -77,7 +77,7 @@ public class GraphTraversal
for(i=0; i<vertices.length; i++)
{
- vertices[i] = (Vertex)vector.elementAt(i);
+ vertices[i] = vector.elementAt(i);
}
return vertices;