1 |
package dk.daoas.adressevedligehold.afstandandenrute;
|
2 |
|
3 |
import java.sql.Connection;
|
4 |
import java.util.HashMap;
|
5 |
import java.util.List;
|
6 |
import java.util.Map;
|
7 |
import java.util.Queue;
|
8 |
import java.util.Set;
|
9 |
import java.util.concurrent.CyclicBarrier;
|
10 |
import java.util.concurrent.Executors;
|
11 |
import java.util.concurrent.ThreadFactory;
|
12 |
import java.util.concurrent.ThreadPoolExecutor;
|
13 |
import java.util.concurrent.atomic.AtomicInteger;
|
14 |
|
15 |
import ags.utils.dataStructures.trees.thirdGenKD.KdTree;
|
16 |
import dk.daoas.adressevedligehold.ReloadHelper;
|
17 |
import dk.daoas.adressevedligehold.ServiceConfig;
|
18 |
import dk.daoas.adressevedligehold.beans.Address;
|
19 |
import dk.daoas.adressevedligehold.db.DBConnection;
|
20 |
import dk.daoas.adressevedligehold.tasks.Task;
|
21 |
import dk.daoas.adressevedligehold.tasks.TaskLogger;
|
22 |
|
23 |
|
24 |
|
25 |
public class AfstandAndenRuteTask extends Task {
|
26 |
|
27 |
|
28 |
private TaskLogger logger = TaskLogger.getInstance();
|
29 |
|
30 |
final static boolean VERBOSE = false;//
|
31 |
|
32 |
public final static String INCREMENTAL = "INCREMENTAL";
|
33 |
public final static String FULL = "FULL";
|
34 |
|
35 |
|
36 |
static boolean test_mode;
|
37 |
|
38 |
|
39 |
String distributor;
|
40 |
int antalIkkeDaekkede = 0;
|
41 |
|
42 |
AtomicInteger antalBeregnet = new AtomicInteger();
|
43 |
|
44 |
|
45 |
|
46 |
ThreadPoolExecutor threadPool;
|
47 |
|
48 |
boolean isIncremental;
|
49 |
|
50 |
|
51 |
public AfstandAndenRuteTask(String distributor, String type) {
|
52 |
this.distributor = distributor;
|
53 |
|
54 |
type = type.toUpperCase();
|
55 |
switch(type) {
|
56 |
case FULL:
|
57 |
isIncremental = false;
|
58 |
break;
|
59 |
case INCREMENTAL:
|
60 |
isIncremental = true;
|
61 |
break;
|
62 |
default:
|
63 |
throw new RuntimeException("Unknown type" + type);
|
64 |
}
|
65 |
}
|
66 |
|
67 |
|
68 |
@Override
|
69 |
protected void taskRun() throws Exception {
|
70 |
|
71 |
|
72 |
Constants.init(distributor);
|
73 |
Constants consts = Constants.getInstance();
|
74 |
|
75 |
int max_workers = ServiceConfig.getInstance().maxWorkers;
|
76 |
if (max_workers <= 0) {
|
77 |
logger.info("!!! AUTO-DETECT MAX_WORKERS !!!");
|
78 |
int cores = Runtime.getRuntime().availableProcessors();
|
79 |
cores -= 1;//Efterlad 1 core/cpu i reserve til systemet
|
80 |
|
81 |
max_workers = Math.max(1, cores); //Dog skal der som minimum være 1 core til beregning
|
82 |
|
83 |
}
|
84 |
if (test_mode) {
|
85 |
max_workers = 1;
|
86 |
}
|
87 |
logger.info("Starting with MAX_WORKERS:" + max_workers);
|
88 |
setupThreadPool(max_workers);
|
89 |
|
90 |
logger.info("Starting with INCREMENTAL:" + isIncremental);
|
91 |
|
92 |
|
93 |
|
94 |
|
95 |
|
96 |
|
97 |
|
98 |
AtomicInteger antalFundne = new AtomicInteger(0);
|
99 |
|
100 |
long start = System.currentTimeMillis();
|
101 |
AtomicInteger antalDaekkedeAdresser = new AtomicInteger(-1);
|
102 |
|
103 |
|
104 |
// MAIN RUN START
|
105 |
|
106 |
logger.info("======================================================================");
|
107 |
|
108 |
mainRun(consts, isIncremental, "ruteMa", max_workers, antalFundne, antalDaekkedeAdresser);
|
109 |
|
110 |
logger.info("======================================================================");
|
111 |
|
112 |
mainRun(consts, true, "ruteLo", max_workers, antalFundne, antalDaekkedeAdresser);
|
113 |
|
114 |
logger.info("======================================================================");
|
115 |
|
116 |
mainRun(consts, true, "ruteSo", max_workers, antalFundne, antalDaekkedeAdresser);
|
117 |
|
118 |
logger.info("======================================================================");
|
119 |
|
120 |
// END OF MAIN run
|
121 |
|
122 |
threadPool.shutdown(); //Calc is done now
|
123 |
|
124 |
|
125 |
ReloadHelper.triggerReload( "AfstandAndenRute/" + distributor );
|
126 |
|
127 |
|
128 |
long now = System.currentTimeMillis();
|
129 |
long elapsed = now - start ;
|
130 |
|
131 |
|
132 |
|
133 |
logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
|
134 |
logger.info("Antal daekkede : " + antalDaekkedeAdresser );
|
135 |
logger.info("Antal ikke-daekkede : " + antalIkkeDaekkede );
|
136 |
logger.info("Heraf, antal fundne : " + antalFundne );
|
137 |
|
138 |
logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne.get() *100.0)/antalIkkeDaekkede ) );
|
139 |
}
|
140 |
|
141 |
|
142 |
private void mainRun(Constants consts, boolean localIsIncremental, String ugedag, int max_workers, AtomicInteger antalFundne, AtomicInteger antalDaekkedeAdresser) throws Exception {
|
143 |
|
144 |
logger.info("MainRun() isIncremental=" + localIsIncremental + " ugedag=" + ugedag);
|
145 |
|
146 |
try (Connection conn = DBConnection.getConnection() ) {
|
147 |
DatabaseRouteDistance db = new DatabaseRouteDistance(conn, localIsIncremental, ugedag);
|
148 |
|
149 |
if (localIsIncremental) {
|
150 |
db.prepareIncrementalSearch();
|
151 |
}
|
152 |
|
153 |
Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
|
154 |
antalIkkeDaekkede += ikkeDaekkede.size();
|
155 |
logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );
|
156 |
|
157 |
|
158 |
|
159 |
logger.info("Finder postnumre");
|
160 |
Set<Short> postnumre = db.hentPostnumreCache();
|
161 |
|
162 |
// Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen
|
163 |
for(short postnr : postnumre) { //
|
164 |
logger.info("Validerer BBox for " + postnr);
|
165 |
BoundingBox bbox = db.getBoundingbox(postnr);
|
166 |
bbox.validateBbox();
|
167 |
}
|
168 |
|
169 |
|
170 |
logger.info("Henter alle daekkede adresser");
|
171 |
int tmpAntalDaekkede = db.hentAlleDaekkedeAdresser(distributor);
|
172 |
antalDaekkedeAdresser.set(tmpAntalDaekkede);
|
173 |
logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );
|
174 |
|
175 |
Map<Short, List<Address>> addrHoList = db.getDaekkedeAdresserHO();
|
176 |
|
177 |
Map<Short, KdTree<Address>> hoTrees = new HashMap<Short,KdTree<Address>>();
|
178 |
|
179 |
for ( Map.Entry<Short, List<Address>> entry : addrHoList.entrySet() ) {
|
180 |
short ho = entry.getKey();
|
181 |
List<Address> geopoints = entry.getValue();
|
182 |
|
183 |
logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() );
|
184 |
|
185 |
int bucketSize = 96*12;
|
186 |
|
187 |
KdTree<Address> addressTree = new KdTree<Address>( 3, bucketSize );
|
188 |
for(Address a: geopoints) {
|
189 |
addressTree.addPoint(a.xyz, a);
|
190 |
}
|
191 |
|
192 |
hoTrees.put(ho, addressTree);
|
193 |
}
|
194 |
|
195 |
db.resetResultTable();
|
196 |
|
197 |
|
198 |
logger.info("Starter beregning");
|
199 |
|
200 |
//pre-check er ok - reset tmp tabel og start søgningen
|
201 |
|
202 |
CyclicBarrier barrier = new CyclicBarrier(max_workers + 1);
|
203 |
|
204 |
for (int i=0; i<max_workers; i++) {
|
205 |
LookupWorker worker = new LookupWorker(i, this, barrier, ikkeDaekkede, hoTrees,antalFundne,antalBeregnet,db,VERBOSE,consts);
|
206 |
threadPool.submit( worker );
|
207 |
}
|
208 |
|
209 |
barrier.await(); // Afvent at workerne bliver færdige
|
210 |
|
211 |
logger.info("Calc is done - cleaning up remaining bits");
|
212 |
|
213 |
|
214 |
db.saveBatch();
|
215 |
|
216 |
if (test_mode == false && this.isAborted() == false) {
|
217 |
db.renameResultTables();
|
218 |
|
219 |
|
220 |
} else {
|
221 |
logger.info( "Rename tables is disabled !!!" );
|
222 |
}
|
223 |
|
224 |
}
|
225 |
}
|
226 |
|
227 |
|
228 |
|
229 |
static String formatMilliSeconds(long milliseconds) {
|
230 |
int mseconds = (int) milliseconds % 1000;
|
231 |
int seconds = (int) (milliseconds / 1000) % 60 ;
|
232 |
int minutes = (int) ((milliseconds / (1000*60)) % 60);
|
233 |
int hours = (int) ((milliseconds / (1000*60*60)) % 24);
|
234 |
|
235 |
return String.format("%02d:%02d:%02d.%03d", hours, minutes, seconds, mseconds);
|
236 |
}
|
237 |
|
238 |
private void setupThreadPool(int max_workers) {
|
239 |
threadPool = (ThreadPoolExecutor) Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() );
|
240 |
}
|
241 |
|
242 |
static class WorkerThreadFactory implements ThreadFactory {
|
243 |
int count = 0;
|
244 |
|
245 |
@Override
|
246 |
public Thread newThread(Runnable r) {
|
247 |
return new Thread(r, "lookupWorker/" + count++);
|
248 |
}
|
249 |
}
|
250 |
|
251 |
|
252 |
|
253 |
|
254 |
|
255 |
|
256 |
@Override
|
257 |
public String getDescription() {
|
258 |
return "Afstand anden rute/" + distributor;
|
259 |
}
|
260 |
|
261 |
|
262 |
|
263 |
@Override
|
264 |
public String getDetail() {
|
265 |
if (isIncremental) {
|
266 |
return "Type: incremental";
|
267 |
} else {
|
268 |
return "Type: full";
|
269 |
}
|
270 |
}
|
271 |
|
272 |
|
273 |
|
274 |
@Override
|
275 |
public double getPercentCompleted() {
|
276 |
if (antalIkkeDaekkede == 0) {//avoid division by zero
|
277 |
return -1;
|
278 |
}
|
279 |
|
280 |
return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0;
|
281 |
}
|
282 |
}
|