package dk.daoas.fulddaekning;

import java.sql.SQLException;
import java.util.Collection;
import java.util.Map;
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 = ikkeDaekkede.remove();

			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 = osrmHelper.getNearestViaTable(qAdresse, res);
			//System.out.println("Bedste:" + bedsteAdr );

			double 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) {
			//Do nothing
		}


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

}