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;

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