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