daoas/fulddaekning/LookupMain.java

package dk.daoas.fulddaekning;

import java.io.File;
import java.io.FileReader;
import java.sql.SQLException;
import java.util.Collection;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.logging.FileHandler;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.logging.SimpleFormatter;

import com.jwetherell.algorithms.data_structures.KdTree;

import dk.daoas.fulddaekning.osrm.OSRMHelper;

public class LookupMain {
        
         static class LookupResult {
                 double bedsteAfstand = 9999999.999;
                 Adresse bedsteAdr = null;
         }


        static final String CONFIG_FILENAME = "fulddaekning.properties";
        
        static boolean rename_tables;
        static SafeProperties conf;
        
        static int max_workers;
        static boolean verbose;
        
        static String distributor;

        final static Logger logger = Logger.getLogger( LookupMain.class.toString() );
        
        
        static final int MAX_RESULTS = 100;
        
        static OSRMHelper osrmHelper = new OSRMHelper();

        
        public static void main(String[] args) throws Exception {
                
                //Setup j.u.l Logger
                Logger root = Logger.getLogger("");
                FileHandler fhandler = new FileHandler("fulddaekning.log"); // Ingen max størrelse, ingen rotation og ingen append
                fhandler.setFormatter( new SimpleFormatter() );
                root.addHandler( fhandler );
                
                
                File confFile = new File( CONFIG_FILENAME );
                if (! confFile.exists() ) {
                        logger.warning("Config file not found: " + CONFIG_FILENAME);
                        System.exit(1);
                }
                                
                conf = new SafeProperties();
                conf.load( new FileReader(confFile) );
                
                
                verbose = Boolean.parseBoolean( conf.getSafeProperty("VERBOSE") );
                logger.info("Starting with VERBOSE:" + verbose);
                
                rename_tables = Boolean.parseBoolean( conf.getSafeProperty("RENAMETABLES") );
                logger.info("Starting with RENAMETABLES:" + rename_tables);
                
                distributor = conf.getSafeProperty("DISTRIBUTOR");
                distributor = distributor.toUpperCase();
                logger.info("Starting for DISTRIBUTOR:" + distributor);
                
                Constants.init(distributor);
                Constants consts = Constants.getInstance();
                
                Database db = new Database(conf);
                Adresse ikkeDaekkede[] = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
                logger.info("Antal ikke-daekkede: " + ikkeDaekkede.length);
                
                boolean testRun= false;
                
                int antalFundne = 0;
                
                long beregnStart =0;
                long start = System.currentTimeMillis();
                int antalDaekkedeAdresser = -1;
                
                if (testRun == false) {
                
                        logger.info("Finder postnumre");
                        Set<Short> postnumre = db.hentPostnumreCache();
                        
                        // Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen
                        for(short postnr : postnumre) { //
                                logger.info("Validerer BBox for " + postnr);
                                BoundingBox bbox = db.getBoundingbox(postnr);
                                bbox.validateBbox();
                        }
                        

                        logger.info("Henter alle daekkede adresser");
                        antalDaekkedeAdresser = db.hentAlleDaekkedeAdresser();
                        logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );
                        
                        Map<Short, List<Adresse>> addrHoList = db.getDaekkedeAdresserHO();
                        
                        Map<Short, KdTree<Adresse>> hoTrees = new HashMap<Short,KdTree<Adresse>>();
                        
                        for ( Map.Entry<Short, List<Adresse>> entry : addrHoList.entrySet() ) {
                                short ho = entry.getKey();
                                List<Adresse> geopoints = entry.getValue();
                                
                                logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() );
                                
                                @SuppressWarnings("unchecked")
                                List<KdTree.XYZPoint> tmpPoints = (List<KdTree.XYZPoint>)(List<?>) geopoints;
                                
                                KdTree<Adresse> addressTree = new KdTree<Adresse>( tmpPoints );
                                hoTrees.put(ho, addressTree);                           
                        }
                        
                        db.resetResultTable();
                
                        beregnStart = System.currentTimeMillis();
                        logger.info("Starter beregning");
                
                        final int workerId = -1;
                        //pre-check er ok - reset tmp tabel og start søgningen
                        
                        for (Adresse qAdresse : ikkeDaekkede) {
                                
                                short ho = qAdresse.ho;
                                KdTree<Adresse> addressTree = hoTrees.get(ho);
                                
                                LookupResult result = new LookupResult();
                                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);
                                }
                                
                                
                                result.bedsteAdr = osrmHelper.getNearestViaTable(qAdresse, res);
                                System.out.println("Bedste:" + result.bedsteAdr );

                                result.bedsteAfstand = GeoPointHelper.beregnAfstand(qAdresse, result.bedsteAdr);
                        
                        
                                if (result.bedsteAfstand <= consts.getMaxDistance() ) { //Gem kun hvis distancen er under max_distance for distributøren
                                        if (verbose == true) {
                                                logger.fine("(" +workerId + ") Bedste: " + qAdresse + "==>" + result.bedsteAdr + " ::: " + result.bedsteAfstand );
                                        }
                                        
                                        antalFundne++;
                                        
                                        try {
                                                db.gemResultat(qAdresse, result.bedsteAdr, result.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 + " > " + result.bedsteAfstand);
                                        }
                                }
                                
                        }
                        
                        db.saveBatch();
                        
                        if (rename_tables) {
                                db.renameResultTables();
                        } else {
                                logger.info( "Rename tables is disabled !!!" );
                        }
                        
        
                } else {
                        /// Test
                        /*
                        db.resetResultTable();
                        

                        alleDaekkedeAdresser = db.hentAlleDaekkedeAdresser();
                        logger.info( "AlleDaekkedeAdresser.length=" + alleDaekkedeAdresser.size());

                        short post = (short) 2700;                      
                        Lookup lookup = new Lookup(post, db, threadPool);
                        lookup.doLookup();*/                                                            
                }

                
                long now = System.currentTimeMillis();
                long elapsed = now - start ;
                long elapsedBeregn = now - beregnStart;
                

                logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
                logger.info("Fuld load done (beregning) : " + formatMilliSeconds(elapsedBeregn) );
                logger.info("Antal daekkede : " + antalDaekkedeAdresser );
                logger.info("Antal ikke-daekkede : " + ikkeDaekkede.length );
                logger.info("Heraf, antal fundne : " + antalFundne );
                
                logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne*100.0)/ikkeDaekkede.length ) );
                //logger.info("Fandt adresser til : " + (antalFundne*100.0)/ikkeDaekkede.length + "%" );
        }

        
        static String formatMilliSeconds(long milliseconds) {
                int mseconds = (int) milliseconds % 1000;
                int seconds = (int) (milliseconds / 1000) % 60 ;
                int minutes = (int) ((milliseconds / (1000*60)) % 60);
                int hours   = (int) ((milliseconds / (1000*60*60)) % 24);
                
                return String.format("%02d:%02d:%02d.%03d", hours, minutes, seconds, mseconds);
        }
        
}
1	torben	2241	package dk.daoas.fulddaekning;
2
3			import java.io.File;
4			import java.io.FileReader;
5	torben	2585	import java.sql.SQLException;
6	torben	2707	import java.util.Collection;
7	torben	2597	import java.util.HashMap;
8	torben	2585	import java.util.List;
9	torben	2597	import java.util.Map;
10	torben	2328	import java.util.Set;
11	torben	2241	import java.util.logging.FileHandler;
12	torben	2585	import java.util.logging.Level;
13	torben	2241	import java.util.logging.Logger;
14			import java.util.logging.SimpleFormatter;
15
16	torben	2707	import com.jwetherell.algorithms.data_structures.KdTree;
17
18	torben	2708	import dk.daoas.fulddaekning.osrm.OSRMHelper;
19
20	torben	2241	public class LookupMain {
21	torben	2585
22			static class LookupResult {
23			double bedsteAfstand = 9999999.999;
24			Adresse bedsteAdr = null;
25			}
26	torben	2241
27
28			static final String CONFIG_FILENAME = "fulddaekning.properties";
29
30			static boolean rename_tables;
31			static SafeProperties conf;
32
33			static int max_workers;
34			static boolean verbose;
35
36			static String distributor;
37
38			final static Logger logger = Logger.getLogger( LookupMain.class.toString() );
39
40
41
42	torben	2708	static final int MAX_RESULTS = 100;
43	torben	2597
44	torben	2708	static OSRMHelper osrmHelper = new OSRMHelper();
45	torben	2259
46	torben	2241
47
48			public static void main(String[] args) throws Exception {
49
50			//Setup j.u.l Logger
51			Logger root = Logger.getLogger("");
52			FileHandler fhandler = new FileHandler("fulddaekning.log"); // Ingen max størrelse, ingen rotation og ingen append
53			fhandler.setFormatter( new SimpleFormatter() );
54			root.addHandler( fhandler );
55
56
57
58
59			File confFile = new File( CONFIG_FILENAME );
60			if (! confFile.exists() ) {
61			logger.warning("Config file not found: " + CONFIG_FILENAME);
62			System.exit(1);
63			}
64
65			conf = new SafeProperties();
66			conf.load( new FileReader(confFile) );
67
68
69	torben	2243
70	torben	2241	verbose = Boolean.parseBoolean( conf.getSafeProperty("VERBOSE") );
71			logger.info("Starting with VERBOSE:" + verbose);
72
73			rename_tables = Boolean.parseBoolean( conf.getSafeProperty("RENAMETABLES") );
74			logger.info("Starting with RENAMETABLES:" + rename_tables);
75
76			distributor = conf.getSafeProperty("DISTRIBUTOR");
77			distributor = distributor.toUpperCase();
78			logger.info("Starting for DISTRIBUTOR:" + distributor);
79
80			Constants.init(distributor);
81			Constants consts = Constants.getInstance();
82
83			Database db = new Database(conf);
84	torben	2585	Adresse ikkeDaekkede[] = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
85	torben	2591	logger.info("Antal ikke-daekkede: " + ikkeDaekkede.length);
86	torben	2241
87			boolean testRun= false;
88
89	torben	2587	int antalFundne = 0;
90	torben	2241
91	torben	2707	long beregnStart =0;
92	torben	2241	long start = System.currentTimeMillis();
93	torben	2597	int antalDaekkedeAdresser = -1;
94
95	torben	2241	if (testRun == false) {
96
97			logger.info("Finder postnumre");
98	torben	2575	Set<Short> postnumre = db.hentPostnumreCache();
99	torben	2241
100			// Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen
101	torben	2575	for(short postnr : postnumre) { //
102	torben	2241	logger.info("Validerer BBox for " + postnr);
103			BoundingBox bbox = db.getBoundingbox(postnr);
104			bbox.validateBbox();
105			}
106
107	torben	2263
108			logger.info("Henter alle daekkede adresser");
109	torben	2597	antalDaekkedeAdresser = db.hentAlleDaekkedeAdresser();
110			logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );
111	torben	2241
112	torben	2707	Map<Short, List<Adresse>> addrHoList = db.getDaekkedeAdresserHO();
113	torben	2585
114	torben	2707	Map<Short, KdTree<Adresse>> hoTrees = new HashMap<Short,KdTree<Adresse>>();
115	torben	2597
116	torben	2707	for ( Map.Entry<Short, List<Adresse>> entry : addrHoList.entrySet() ) {
117	torben	2597	short ho = entry.getKey();
118	torben	2707	List<Adresse> geopoints = entry.getValue();
119	torben	2597
120			logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() );
121	torben	2707
122			@SuppressWarnings("unchecked")
123			List<KdTree.XYZPoint> tmpPoints = (List<KdTree.XYZPoint>)(List<?>) geopoints;
124
125			KdTree<Adresse> addressTree = new KdTree<Adresse>( tmpPoints );
126	torben	2597	hoTrees.put(ho, addressTree);
127			}
128
129	torben	2585	db.resetResultTable();
130
131	torben	2707	beregnStart = System.currentTimeMillis();
132	torben	2585	logger.info("Starter beregning");
133
134			final int workerId = -1;
135	torben	2241	//pre-check er ok - reset tmp tabel og start søgningen
136
137	torben	2585	for (Adresse qAdresse : ikkeDaekkede) {
138
139	torben	2597	short ho = qAdresse.ho;
140	torben	2707	KdTree<Adresse> addressTree = hoTrees.get(ho);
141	torben	2585
142			LookupResult result = new LookupResult();
143	torben	2708	Collection<Adresse> res = addressTree.nearestNeighbourSearch(MAX_RESULTS, qAdresse);
144			if (res.size() > MAX_RESULTS ) {
145			System.out.println("Returnerede mere end MAX_RESULTS> " + res.size() );
146	torben	2707	System.exit(0);
147			}
148
149	torben	2708
150			result.bedsteAdr = osrmHelper.getNearestViaTable(qAdresse, res);
151			System.out.println("Bedste:" + result.bedsteAdr );
152
153	torben	2585	result.bedsteAfstand = GeoPointHelper.beregnAfstand(qAdresse, result.bedsteAdr);
154
155
156			if (result.bedsteAfstand <= consts.getMaxDistance() ) { //Gem kun hvis distancen er under max_distance for distributøren
157	torben	2589	if (verbose == true) {
158	torben	2585	logger.fine("(" +workerId + ") Bedste: " + qAdresse + "==>" + result.bedsteAdr + " ::: " + result.bedsteAfstand );
159			}
160
161	torben	2587	antalFundne++;
162
163	torben	2585	try {
164			db.gemResultat(qAdresse, result.bedsteAdr, result.bedsteAfstand);
165			} catch (SQLException e) {
166			logger.log(Level.WARNING, "Error saving result", e);
167			logger.warning("Shutting down");
168
169			System.exit(0); //hvis at indsættelsen fejler skal vi afbryde med det samme
170			}
171			} else {
172	torben	2589	if (verbose == true) {
173	torben	2586	System.out.println("For stor afstand: " + qAdresse + " > " + result.bedsteAfstand);
174			}
175	torben	2585	}
176
177	torben	2241	}
178
179	torben	2585	db.saveBatch();
180
181	torben	2241	if (rename_tables) {
182			db.renameResultTables();
183			} else {
184			logger.info( "Rename tables is disabled !!!" );
185			}
186
187
188
189			} else {
190			/// Test
191	torben	2585	/*
192	torben	2241	db.resetResultTable();
193
194	torben	2422
195			alleDaekkedeAdresser = db.hentAlleDaekkedeAdresser();
196	torben	2585	logger.info( "AlleDaekkedeAdresser.length=" + alleDaekkedeAdresser.size());
197	torben	2422
198	torben	2575	short post = (short) 2700;
199			Lookup lookup = new Lookup(post, db, threadPool);
200	torben	2585	lookup.doLookup();*/
201	torben	2241	}
202	torben	2260
203	torben	2241
204			long now = System.currentTimeMillis();
205			long elapsed = now - start ;
206	torben	2707	long elapsedBeregn = now - beregnStart;
207	torben	2241
208	torben	2585
209	torben	2241	logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
210	torben	2707	logger.info("Fuld load done (beregning) : " + formatMilliSeconds(elapsedBeregn) );
211	torben	2597	logger.info("Antal daekkede : " + antalDaekkedeAdresser );
212	torben	2587	logger.info("Antal ikke-daekkede : " + ikkeDaekkede.length );
213			logger.info("Heraf, antal fundne : " + antalFundne );
214	torben	2688
215			logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne*100.0)/ikkeDaekkede.length ) );
216			//logger.info("Fandt adresser til : " + (antalFundne*100.0)/ikkeDaekkede.length + "%" );
217	torben	2241	}
218
219
220
221			static String formatMilliSeconds(long milliseconds) {
222			int mseconds = (int) milliseconds % 1000;
223			int seconds = (int) (milliseconds / 1000) % 60 ;
224			int minutes = (int) ((milliseconds / (1000*60)) % 60);
225			int hours = (int) ((milliseconds / (10006060)) % 24);
226
227			return String.format("%02d:%02d:%02d.%03d", hours, minutes, seconds, mseconds);
228	torben	2260	}
229
230	torben	2241	}