1 |
package dk.daoas.fulddaekning; |
package dk.daoas.fulddaekning; |
2 |
|
|
3 |
import java.sql.SQLException; |
import java.sql.SQLException; |
|
import java.util.ArrayList; |
|
4 |
import java.util.Queue; |
import java.util.Queue; |
5 |
import java.util.logging.Level; |
import java.util.logging.Level; |
6 |
import java.util.logging.Logger; |
import java.util.logging.Logger; |
18 |
|
|
19 |
@Override |
@Override |
20 |
public void run() { |
public void run() { |
21 |
ArrayList<Adresse> daekkede = lookup.getWorkSet().daekkedeAdresser; |
Constants consts = Constants.getInstance(); |
22 |
Queue<Adresse> queue = lookup.getWorkSet().ikkeDaekkede; |
|
23 |
|
Adresse daekkede[] = lookup.getDaekkedeAdresser(); |
24 |
|
Queue<Adresse> queue = lookup.getQueue(); |
25 |
Database db = lookup.getDb(); |
Database db = lookup.getDb(); |
26 |
|
|
27 |
Adresse qAdresse; |
Adresse qAdresse; |
33 |
|
|
34 |
double bedsteAfstand = 9999999.999; |
double bedsteAfstand = 9999999.999; |
35 |
Adresse bedsteAdr = null; |
Adresse bedsteAdr = null; |
36 |
for (int i=0; i<daekkede.size(); i++) { |
for (int i=0; i<daekkede.length; i++) { |
37 |
Adresse daekket = daekkede.get(i); |
Adresse daekket = daekkede[i]; |
38 |
double afstand = Adresse.beregnAfstand(qAdresse, daekket); |
double afstand = Adresse.beregnAfstand(qAdresse, daekket); |
39 |
|
|
40 |
if (afstand < bedsteAfstand) { |
if (afstand < bedsteAfstand) { |
46 |
|
|
47 |
if ( bedsteAdr != null) { |
if ( bedsteAdr != null) { |
48 |
|
|
49 |
if (bedsteAfstand <= 6.0) { |
if (bedsteAfstand <= consts.getMaxDistance() ) { //Gem kun hvis distancen er under max_distance for distributøren |
50 |
if (Lookup.verbose == true) { |
if (Lookup.verbose == true) { |
51 |
logger.info("(" +workerId + ") Bedste: " + qAdresse + "==>" + bedsteAdr + " ::: " + bedsteAfstand ); |
logger.info("(" +workerId + ") Bedste: " + qAdresse + "==>" + bedsteAdr + " ::: " + bedsteAfstand ); |
52 |
} |
} |