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