daoas/fulddaekning/LookupWorker.java

package dk.daoas.fulddaekning;

import java.sql.SQLException;
import java.util.Collection;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Queue;
import java.util.concurrent.BrokenBarrierException;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.logging.Level;
import java.util.logging.Logger;

import com.jwetherell.algorithms.data_structures.KdTree;

import dk.daoas.fulddaekning.osrm.OSRMHelper;

public class LookupWorker implements Runnable {

        static final int MAX_RESULTS = 100;


        final static Logger logger = Logger.getLogger( LookupWorker.class.toString() );

        OSRMHelper osrmHelper = new OSRMHelper();

        CyclicBarrier barrier;
        Queue<Adresse> ikkeDaekkede;
        Map<Short, KdTree<Adresse>> hoTrees;
        Database db;
        Constants consts;
        
        AtomicInteger antalFundne;

        int workerID;
        boolean verbose;
        
        public LookupWorker(int workerID, 
                                CyclicBarrier barrier, 
                                Queue<Adresse> ikkeDaekkede, 
                                Map<Short, KdTree<Adresse>> hoTrees, 
                                AtomicInteger antalFundne,
                                Database db,
                                boolean verbose,
                                Constants consts) {
                
                this.workerID = workerID;
                this.barrier = barrier;
                this.ikkeDaekkede = ikkeDaekkede;
                this.hoTrees = hoTrees;
                this.antalFundne = antalFundne;
                this.db = db;
                this.verbose = verbose;
                this.consts = consts;
                
        }


        @Override
        public void run() {
                System.out.println( "Worker/" + workerID + " starting");

                while ( ! ikkeDaekkede.isEmpty() ) {
                        
                        Adresse qAdresse = null;
                        try {
                                qAdresse = ikkeDaekkede.remove();
                        } catch (NoSuchElementException e) {
                                logger.info( "Worker/" + workerID + " NoSuchElementException");
                                break;
                        }

                        short ho = qAdresse.ho;
                        KdTree<Adresse> addressTree = hoTrees.get(ho);

                        Collection<Adresse> res = addressTree.nearestNeighbourSearch(MAX_RESULTS, qAdresse);
                        if (res.size() > MAX_RESULTS ) {
                                System.out.println("Returnerede mere end MAX_RESULTS> " + res.size() );
                                System.exit(0);
                        }


                        Adresse bedsteAdr = res.iterator().next(); //Tag første element
                        double bedsteAfstand = GeoPointHelper.beregnAfstand(qAdresse, bedsteAdr);
                        
                        //Hvis at den er inden for afstand, så prøver vi at lave findNærmste på vej distancen
                        if (bedsteAfstand <= consts.getMaxDistance()) {
                                bedsteAdr = osrmHelper.getNearestViaTable(qAdresse, res);
                                bedsteAfstand = GeoPointHelper.beregnAfstand(qAdresse, bedsteAdr);
                        }
                        

                        if (bedsteAfstand <= consts.getMaxDistance() ) { //Gem kun hvis distancen er under max_distance for distributøren
                                if (verbose == true) {
                                        logger.fine("(" +workerID + ") Bedste: " + qAdresse + "==>" + bedsteAdr + " ::: " + bedsteAfstand );
                                }

                                antalFundne.incrementAndGet();

                                try {
                                        db.gemResultat(qAdresse, bedsteAdr, bedsteAfstand);
                                } catch (SQLException e) {
                                        logger.log(Level.WARNING, "Error saving result", e);
                                        logger.warning("Shutting down");

                                        System.exit(0); //hvis at indsættelsen fejler skal vi afbryde med det samme
                                }
                        } else {
                                if (verbose == true) {
                                        System.out.println("For stor afstand: " + qAdresse + " > " + bedsteAfstand);
                                }
                        }

                }

                try {
                        barrier.await();
                } catch (BrokenBarrierException e) {
                        logger.log(Level.SEVERE, e.getMessage(), e);
                        System.exit(-1);
                } catch(InterruptedException e) {
                        logger.log(Level.SEVERE, e.getMessage(), e);
                }


                System.out.println( "Worker/" + workerID + " stopping");
        }

}
1	package dk.daoas.fulddaekning;
2
3	import java.sql.SQLException;
4	import java.util.Collection;
5	import java.util.Map;
6	import java.util.NoSuchElementException;
7	import java.util.Queue;
8	import java.util.concurrent.BrokenBarrierException;
9	import java.util.concurrent.CyclicBarrier;
10	import java.util.concurrent.atomic.AtomicInteger;
11	import java.util.logging.Level;
12	import java.util.logging.Logger;
13
14	import com.jwetherell.algorithms.data_structures.KdTree;
15
16	import dk.daoas.fulddaekning.osrm.OSRMHelper;
17
18	public class LookupWorker implements Runnable {
19
20	static final int MAX_RESULTS = 100;
21
22
23
24	final static Logger logger = Logger.getLogger( LookupWorker.class.toString() );
25
26	OSRMHelper osrmHelper = new OSRMHelper();
27
28	CyclicBarrier barrier;
29	Queue<Adresse> ikkeDaekkede;
30	Map<Short, KdTree<Adresse>> hoTrees;
31	Database db;
32	Constants consts;
33
34	AtomicInteger antalFundne;
35
36	int workerID;
37	boolean verbose;
38
39	public LookupWorker(int workerID,
40	CyclicBarrier barrier,
41	Queue<Adresse> ikkeDaekkede,
42	Map<Short, KdTree<Adresse>> hoTrees,
43	AtomicInteger antalFundne,
44	Database db,
45	boolean verbose,
46	Constants consts) {
47
48	this.workerID = workerID;
49	this.barrier = barrier;
50	this.ikkeDaekkede = ikkeDaekkede;
51	this.hoTrees = hoTrees;
52	this.antalFundne = antalFundne;
53	this.db = db;
54	this.verbose = verbose;
55	this.consts = consts;
56
57	}
58
59
60	@Override
61	public void run() {
62	System.out.println( "Worker/" + workerID + " starting");
63
64	while ( ! ikkeDaekkede.isEmpty() ) {
65
66	Adresse qAdresse = null;
67	try {
68	qAdresse = ikkeDaekkede.remove();
69	} catch (NoSuchElementException e) {
70	logger.info( "Worker/" + workerID + " NoSuchElementException");
71	break;
72	}
73
74	short ho = qAdresse.ho;
75	KdTree<Adresse> addressTree = hoTrees.get(ho);
76
77	Collection<Adresse> res = addressTree.nearestNeighbourSearch(MAX_RESULTS, qAdresse);
78	if (res.size() > MAX_RESULTS ) {
79	System.out.println("Returnerede mere end MAX_RESULTS> " + res.size() );
80	System.exit(0);
81	}
82
83
84	Adresse bedsteAdr = res.iterator().next(); //Tag første element
85	double bedsteAfstand = GeoPointHelper.beregnAfstand(qAdresse, bedsteAdr);
86
87	//Hvis at den er inden for afstand, så prøver vi at lave findNærmste på vej distancen
88	if (bedsteAfstand <= consts.getMaxDistance()) {
89	bedsteAdr = osrmHelper.getNearestViaTable(qAdresse, res);
90	bedsteAfstand = GeoPointHelper.beregnAfstand(qAdresse, bedsteAdr);
91	}
92
93
94
95
96
97	if (bedsteAfstand <= consts.getMaxDistance() ) { //Gem kun hvis distancen er under max_distance for distributøren
98	if (verbose == true) {
99	logger.fine("(" +workerID + ") Bedste: " + qAdresse + "==>" + bedsteAdr + " ::: " + bedsteAfstand );
100	}
101
102	antalFundne.incrementAndGet();
103
104	try {
105	db.gemResultat(qAdresse, bedsteAdr, bedsteAfstand);
106	} catch (SQLException e) {
107	logger.log(Level.WARNING, "Error saving result", e);
108	logger.warning("Shutting down");
109
110	System.exit(0); //hvis at indsættelsen fejler skal vi afbryde med det samme
111	}
112	} else {
113	if (verbose == true) {
114	System.out.println("For stor afstand: " + qAdresse + " > " + bedsteAfstand);
115	}
116	}
117
118	}
119
120	try {
121	barrier.await();
122	} catch (BrokenBarrierException e) {
123	logger.log(Level.SEVERE, e.getMessage(), e);
124	System.exit(-1);
125	} catch(InterruptedException e) {
126	logger.log(Level.SEVERE, e.getMessage(), e);
127	}
128
129
130	System.out.println( "Worker/" + workerID + " stopping");
131	}
132
133	}