1 |
package dk.daoas.fulddaekning; |
package dk.daoas.fulddaekning; |
2 |
|
|
3 |
import java.sql.SQLException; |
import java.sql.SQLException; |
4 |
import java.util.Collection; |
import java.util.ArrayList; |
5 |
import java.util.Map; |
import java.util.Map; |
|
import java.util.NoSuchElementException; |
|
6 |
import java.util.Queue; |
import java.util.Queue; |
7 |
import java.util.concurrent.BrokenBarrierException; |
import java.util.concurrent.BrokenBarrierException; |
8 |
import java.util.concurrent.CyclicBarrier; |
import java.util.concurrent.CyclicBarrier; |
10 |
import java.util.logging.Level; |
import java.util.logging.Level; |
11 |
import java.util.logging.Logger; |
import java.util.logging.Logger; |
12 |
|
|
13 |
import com.jwetherell.algorithms.data_structures.KdTree; |
import ags.utils.dataStructures.MaxHeap; |
14 |
|
import ags.utils.dataStructures.trees.thirdGenKD.DistanceFunction; |
15 |
|
import ags.utils.dataStructures.trees.thirdGenKD.KdTree; |
16 |
|
import ags.utils.dataStructures.trees.thirdGenKD.SquareEuclideanDistanceFunction; |
17 |
import dk.daoas.fulddaekning.osrm.OSRMHelper; |
import dk.daoas.fulddaekning.osrm.OSRMHelper; |
18 |
|
|
19 |
public class LookupWorker implements Runnable { |
public class LookupWorker implements Runnable { |
37 |
int workerID; |
int workerID; |
38 |
boolean verbose; |
boolean verbose; |
39 |
|
|
40 |
|
DistanceFunction dist = new SquareEuclideanDistanceFunction(); |
41 |
|
|
42 |
public LookupWorker(int workerID, |
public LookupWorker(int workerID, |
43 |
CyclicBarrier barrier, |
CyclicBarrier barrier, |
44 |
Queue<Adresse> ikkeDaekkede, |
Queue<Adresse> ikkeDaekkede, |
72 |
short ho = qAdresse.ho; |
short ho = qAdresse.ho; |
73 |
KdTree<Adresse> addressTree = hoTrees.get(ho); |
KdTree<Adresse> addressTree = hoTrees.get(ho); |
74 |
|
|
75 |
Collection<Adresse> res = addressTree.nearestNeighbourSearch(MAX_RESULTS, qAdresse); |
MaxHeap<Adresse> res = addressTree.findNearestNeighbors(qAdresse.xyz, MAX_RESULTS, dist); |
76 |
if (res.size() > MAX_RESULTS ) { |
//Collection<Adresse> res = addressTree.nearestNeighbourSearch(MAX_RESULTS, qAdresse); |
77 |
|
int size = res.size(); |
78 |
|
if (size > MAX_RESULTS ) { |
79 |
System.out.println("Returnerede mere end MAX_RESULTS> " + res.size() ); |
System.out.println("Returnerede mere end MAX_RESULTS> " + res.size() ); |
80 |
System.exit(0); |
System.exit(0); |
81 |
} |
} |
82 |
|
|
83 |
|
ArrayList<Adresse> adrList = new ArrayList<Adresse>(); |
84 |
|
|
85 |
|
for (int i=0; i<size; i++) { |
86 |
|
Adresse a = res.getMax(); |
87 |
|
double d = res.getMaxKey(); |
88 |
|
adrList.add(a); |
89 |
|
res.removeMax(); |
90 |
|
|
91 |
|
System.out.println(a + " > " + d); |
92 |
|
} |
93 |
|
Adresse bedsteAdr = adrList.get(size-1); //da det er en max-heap er det elementet med størst distance der er først og dermed den sidste der er tættest |
94 |
|
double bedsteAfstand = GeoPointHelper.beregnAfstand(qAdresse, bedsteAdr); |
95 |
|
|
96 |
Adresse bedsteAdr = res.iterator().next(); //Tag første element |
/* |
|
double bedsteAfstand = GeoPointHelper.beregnAfstand(qAdresse, bedsteAdr); |
|
|
|
|
97 |
//Hvis at den er inden for afstand, så prøver vi at lave findNærmste på vej distancen |
//Hvis at den er inden for afstand, så prøver vi at lave findNærmste på vej distancen |
98 |
if (bedsteAfstand <= consts.getMaxDistance()) { |
if (bedsteAfstand <= consts.getMaxDistance()) { |
99 |
Adresse bedsteAdr2 = osrmHelper.getNearestViaTable(qAdresse, res); |
//Adresse bedsteAdr2 = osrmHelper.getNearestViarouteHttp(qAdresse, res); |
100 |
|
//Adresse bedsteAdr2 = osrmHelper.getNearestViarouteJni(qAdresse, res); |
101 |
|
Adresse bedsteAdr2 = osrmHelper.getNearestTableHttp(qAdresse, res); |
102 |
|
//Adresse bedsteAdr2 = osrmHelper.getNearestTableJni(qAdresse, res); |
103 |
|
|
104 |
if (bedsteAdr2 != null) { |
if (bedsteAdr2 != null) { |
105 |
bedsteAdr = bedsteAdr2; |
bedsteAdr = bedsteAdr2; |
108 |
logger.info("NearestViaTable returned null for " + qAdresse); |
logger.info("NearestViaTable returned null for " + qAdresse); |
109 |
} |
} |
110 |
} |
} |
111 |
|
*/ |
112 |
|
|
113 |
|
|
114 |
|
|