Author: toad
Date: 2007-09-21 15:21:47 +0000 (Fri, 21 Sep 2007)
New Revision: 15230
Modified:
trunk/freenet/src/freenet/node/NodeDispatcher.java
Log:
Further simplify - use double[] not Vector of Double
Modified: trunk/freenet/src/freenet/node/NodeDispatcher.java
===================================================================
--- trunk/freenet/src/freenet/node/NodeDispatcher.java 2007-09-21 15:18:34 UTC
(rev 15229)
+++ trunk/freenet/src/freenet/node/NodeDispatcher.java 2007-09-21 15:21:47 UTC
(rev 15230)
@@ -841,6 +841,7 @@
for(int i=0;i<locsNotVisited.length;i++)
notVisitedList.add(new
Double(locsNotVisited[i]));
}
+ // notVisitedList == locsNotVisited
// Find it
ProbeContext ctx;
@@ -875,23 +876,19 @@
// Maybe fork
-
-
try {
double furthestDist = 0.0;
- if(notVisitedList.size() > 0) {
+ if(locsNotVisited.length > 0) {
if(ctx.forkCount < MAX_FORKS) {
ctx.forkCount++;
- Double[] dists = (Double[])
notVisitedList.toArray(new Double[notVisitedList.size()]);
+ double[] dists = new
double[locsNotVisited.length];
for(int i=0;i<dists.length;i++) {
- Double loc = dists[i];
- double l = loc.doubleValue();
- dists[i] = new
Double(Location.distance(l, target, true));
+ dists[i] =
Location.distance(locsNotVisited[i], target, true);
}
Arrays.sort(dists);
- double mustBeBetterThan =
((Double)dists[Math.min(3,dists.length)]).doubleValue();
+ double mustBeBetterThan =
dists[Math.min(3,dists.length)];
double maxDistance =
Location.distance(mustBeBetterThan, target, true);
for(int
i=0;i<notVisitedList.size();i++) {
