package dk.daoas.fulddaekning;

import java.sql.SQLException;
import java.util.ArrayList;
import java.util.Queue;
import java.util.logging.Level;
import java.util.logging.Logger;

public class LookupWorker implements Runnable {
	Logger logger = Logger.getLogger( LookupWorker.class.getName() );
	
	int workerId;
	Lookup lookup;
	
	public LookupWorker(int workerId, Lookup lookup) {
		this.workerId = workerId;
		this.lookup = lookup;
	}

	@Override
	public void run() {
		Constants consts = Constants.getInstance();
		
		Adresse daekkede[] = lookup.getDaekkedeAdresser();
		Queue<Adresse> queue = lookup.getQueue();
		Database db = lookup.getDb();
		
		Adresse qAdresse;
		
		
		
		while ( (qAdresse = queue.poll()) != null) {
			//logger.info("Worker " + workerId + ", analyzing " + qAdresse);			
		
			double bedsteAfstand = 9999999.999;
			Adresse bedsteAdr = null;
			for (int i=0; i<daekkede.length; i++) {
				Adresse daekket = daekkede[i];
				double afstand = Adresse.beregnAfstand(qAdresse, daekket);
				
				if (afstand < bedsteAfstand) {
					bedsteAfstand = afstand;
					bedsteAdr = daekket;
				}
			}
			
			
			if ( bedsteAdr != null) {
				
				if (bedsteAfstand <= consts.getMaxDistance() ) { //Gem kun hvis distancen er under max_distance for distributøren
					if (Lookup.verbose == true) {
						logger.info("(" +workerId + ") Bedste: " + qAdresse + "==>" + bedsteAdr + " ::: " + bedsteAfstand );
					}
					
					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 {
					logger.info("(" +workerId + ") For stor afstand " + qAdresse + " -> " + bedsteAfstand);
				}
			} else {
				logger.warning("(" +workerId + ") Ingen match til " + qAdresse);
			}

		}
		
		
		lookup.shutdownWorker( workerId);
	}

}