7 |
import java.util.Queue; |
import java.util.Queue; |
8 |
import java.util.Set; |
import java.util.Set; |
9 |
import java.util.concurrent.CyclicBarrier; |
import java.util.concurrent.CyclicBarrier; |
10 |
|
import java.util.concurrent.ExecutorService; |
11 |
import java.util.concurrent.Executors; |
import java.util.concurrent.Executors; |
12 |
import java.util.concurrent.ThreadFactory; |
import java.util.concurrent.ThreadFactory; |
|
import java.util.concurrent.ThreadPoolExecutor; |
|
13 |
import java.util.concurrent.atomic.AtomicInteger; |
import java.util.concurrent.atomic.AtomicInteger; |
|
import java.util.logging.Logger; |
|
14 |
|
|
15 |
import ags.utils.dataStructures.trees.thirdGenKD.KdTree; |
import ags.utils.dataStructures.trees.thirdGenKD.KdTree; |
16 |
import dk.daoas.adressevedligehold.ReloadHelper; |
import dk.daoas.adressevedligehold.ReloadTask; |
17 |
import dk.daoas.adressevedligehold.ServiceConfig; |
import dk.daoas.adressevedligehold.ServiceConfig; |
18 |
import dk.daoas.adressevedligehold.beans.Address; |
import dk.daoas.adressevedligehold.beans.Address; |
19 |
import dk.daoas.adressevedligehold.db.DBConnection; |
import dk.daoas.adressevedligehold.db.DBConnection; |
20 |
import dk.daoas.adressevedligehold.tasks.Task; |
import dk.daoas.adressevedligehold.tasks.Task; |
21 |
|
import dk.daoas.adressevedligehold.tasks.TaskLogger; |
22 |
|
|
23 |
|
|
24 |
|
|
25 |
public class AfstandAndenRuteTask extends Task { |
public class AfstandAndenRuteTask extends Task { |
26 |
|
|
27 |
|
|
28 |
final Logger logger = Logger.getLogger( AfstandAndenRuteTask.class.toString() ); |
private TaskLogger logger = TaskLogger.getInstance(); |
29 |
|
|
30 |
final boolean verbose = false;// |
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; |
static boolean test_mode; |
37 |
|
|
38 |
|
|
39 |
String distributor; |
String distributor; |
40 |
int antalIkkeDaekkede = -1; |
int antalIkkeDaekkede = 0; |
41 |
|
|
42 |
AtomicInteger antalBeregnet = new AtomicInteger(); |
AtomicInteger antalBeregnet = new AtomicInteger(); |
43 |
|
|
44 |
|
|
45 |
|
|
46 |
ThreadPoolExecutor threadPool; |
ExecutorService threadPool; |
47 |
|
|
48 |
|
boolean isIncremental; |
49 |
|
|
50 |
|
|
51 |
public AfstandAndenRuteTask(String distributor) { |
public AfstandAndenRuteTask(String distributor, String type) { |
52 |
this.distributor = distributor; |
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 |
@Override |
69 |
protected void taskRun() throws Exception { |
protected void taskRun() throws Exception { |
70 |
|
|
|
|
|
|
|
|
|
|
|
|
//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 ); |
|
|
|
|
|
|
|
71 |
|
|
72 |
Constants.init(distributor); |
Constants.init(distributor); |
73 |
Constants consts = Constants.getInstance(); |
Constants consts = Constants.getInstance(); |
86 |
} |
} |
87 |
logger.info("Starting with MAX_WORKERS:" + max_workers); |
logger.info("Starting with MAX_WORKERS:" + max_workers); |
88 |
setupThreadPool(max_workers); |
setupThreadPool(max_workers); |
89 |
|
|
90 |
|
logger.info("Starting with INCREMENTAL:" + isIncremental); |
91 |
|
|
92 |
|
|
93 |
|
|
94 |
try (Connection conn = DBConnection.getConnection() ) { |
|
|
Database db = new Database(conn); |
|
95 |
|
|
|
Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() ); |
|
|
antalIkkeDaekkede = ikkeDaekkede.size(); |
|
|
logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede ); |
|
96 |
|
|
97 |
|
|
98 |
boolean testRun= false; |
AtomicInteger antalFundne = new AtomicInteger(0); |
99 |
|
|
100 |
AtomicInteger antalFundne = new AtomicInteger(0); |
long start = System.currentTimeMillis(); |
101 |
|
AtomicInteger antalDaekkedeAdresser = new AtomicInteger(-1); |
102 |
|
|
|
long beregnStart =0; |
|
|
long start = System.currentTimeMillis(); |
|
|
int antalDaekkedeAdresser = -1; |
|
103 |
|
|
104 |
if (testRun == false) { |
// MAIN RUN START |
105 |
|
|
106 |
logger.info("Finder postnumre"); |
logger.info("======================================================================"); |
107 |
Set<Short> postnumre = db.hentPostnumreCache(); |
|
108 |
|
mainRun(consts, isIncremental, "ruteMa", max_workers, antalFundne, antalDaekkedeAdresser); |
109 |
// Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen |
|
110 |
for(short postnr : postnumre) { // |
logger.info("======================================================================"); |
111 |
logger.info("Validerer BBox for " + postnr); |
|
112 |
BoundingBox bbox = db.getBoundingbox(postnr); |
mainRun(consts, true, "ruteLo", max_workers, antalFundne, antalDaekkedeAdresser); |
113 |
bbox.validateBbox(); |
|
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 |
logger.info("Henter alle daekkede adresser"); |
manager.submitTask( new ReloadTask("AfstandAndenRute/" + distributor) ); |
126 |
antalDaekkedeAdresser = db.hentAlleDaekkedeAdresser(distributor); |
|
|
logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser ); |
|
127 |
|
|
128 |
Map<Short, List<Address>> addrHoList = db.getDaekkedeAdresserHO(); |
long now = System.currentTimeMillis(); |
129 |
|
long elapsed = now - start ; |
130 |
|
|
|
Map<Short, KdTree<Address>> hoTrees = new HashMap<Short,KdTree<Address>>(); |
|
131 |
|
|
|
for ( Map.Entry<Short, List<Address>> entry : addrHoList.entrySet() ) { |
|
|
short ho = entry.getKey(); |
|
|
List<Address> geopoints = entry.getValue(); |
|
132 |
|
|
133 |
logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() ); |
logger.info("Fuld load done : " + formatMilliSeconds(elapsed) ); |
134 |
|
logger.info("Antal daekkede : " + antalDaekkedeAdresser ); |
135 |
int bucketSize = 96*12; |
logger.info("Antal ikke-daekkede : " + antalIkkeDaekkede ); |
136 |
|
logger.info("Heraf, antal fundne : " + antalFundne ); |
|
KdTree<Address> addressTree = new KdTree<Address>( 3, bucketSize ); |
|
|
for(Address a: geopoints) { |
|
|
addressTree.addPoint(a.xyz, a); |
|
|
} |
|
|
|
|
|
hoTrees.put(ho, addressTree); |
|
|
} |
|
|
|
|
|
db.resetResultTable(); |
|
|
|
|
|
beregnStart = System.currentTimeMillis(); |
|
|
logger.info("Starter beregning"); |
|
|
|
|
|
//pre-check er ok - reset tmp tabel og start søgningen |
|
|
|
|
|
CyclicBarrier barrier = new CyclicBarrier(max_workers + 1); |
|
|
|
|
|
for (int i=0; i<max_workers; i++) { |
|
|
LookupWorker worker = new LookupWorker(i, this, barrier, ikkeDaekkede, hoTrees,antalFundne,antalBeregnet,db,verbose,consts); |
|
|
threadPool.submit( worker ); |
|
|
} |
|
|
|
|
|
barrier.await(); // Afvent at workerne bliver færdige |
|
|
|
|
|
logger.info("Calc is done - cleaning up remaining bits"); |
|
|
|
|
|
threadPool.shutdown(); //Calc is done now |
|
137 |
|
|
138 |
|
logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne.get() *100.0)/antalIkkeDaekkede ) ); |
139 |
|
} |
140 |
|
|
|
db.saveBatch(); |
|
141 |
|
|
142 |
if (test_mode == false && this.isAborted() == false) { |
private void mainRun(Constants consts, boolean localIsIncremental, String ugedag, int max_workers, AtomicInteger antalFundne, AtomicInteger antalDaekkedeAdresser) throws Exception { |
143 |
db.renameResultTables(); |
|
144 |
|
logger.info("MainRun() isIncremental=" + localIsIncremental + " ugedag=" + ugedag); |
145 |
ReloadHelper.triggerReload( "AfstandAndenRute/" + distributor ); |
|
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 |
} else { |
logger.info("Finder postnumre"); |
160 |
logger.info( "Rename tables is disabled !!!" ); |
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 { |
} else { |
221 |
/// Test |
logger.info( "Rename tables is disabled !!!" ); |
|
/* |
|
|
db.resetResultTable(); |
|
|
|
|
|
|
|
|
alleDaekkedeAdresser = db.hentAlleDaekkedeAdresser(); |
|
|
logger.info( "AlleDaekkedeAdresser.length=" + alleDaekkedeAdresser.size()); |
|
|
|
|
|
short post = (short) 2700; |
|
|
Lookup lookup = new Lookup(post, db, threadPool); |
|
|
lookup.doLookup();*/ |
|
222 |
} |
} |
223 |
|
|
|
|
|
|
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 : " + antalIkkeDaekkede ); |
|
|
logger.info("Heraf, antal fundne : " + antalFundne ); |
|
|
|
|
|
logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne.get() *100.0)/antalIkkeDaekkede ) ); |
|
|
//logger.info("Fandt adresser til : " + (antalFundne*100.0)/ikkeDaekkede.length + "%" ); |
|
|
|
|
224 |
} |
} |
225 |
} |
} |
226 |
|
|
236 |
} |
} |
237 |
|
|
238 |
private void setupThreadPool(int max_workers) { |
private void setupThreadPool(int max_workers) { |
239 |
threadPool = (ThreadPoolExecutor) Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() ); |
threadPool = Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() ); |
240 |
} |
} |
241 |
|
|
242 |
static class WorkerThreadFactory implements ThreadFactory { |
static class WorkerThreadFactory implements ThreadFactory { |
262 |
|
|
263 |
@Override |
@Override |
264 |
public String getDetail() { |
public String getDetail() { |
265 |
// TODO Auto-generated method stub |
if (isIncremental) { |
266 |
return ""; |
return "Type: incremental"; |
267 |
|
} else { |
268 |
|
return "Type: full"; |
269 |
|
} |
270 |
} |
} |
271 |
|
|
272 |
|
|
273 |
|
|
274 |
@Override |
@Override |
275 |
public double getPercentCompleted() { |
public double getPercentCompleted() { |
276 |
|
if (antalIkkeDaekkede == 0) {//avoid division by zero |
277 |
|
return -1; |
278 |
|
} |
279 |
|
|
280 |
return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0; |
return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0; |
281 |
} |
} |
282 |
} |
} |