15 |
import dk.daoas.adressevedligehold.beans.Address; |
import dk.daoas.adressevedligehold.beans.Address; |
16 |
import dk.daoas.adressevedligehold.beans.Address.AddressState; |
import dk.daoas.adressevedligehold.beans.Address.AddressState; |
17 |
import dk.daoas.adressevedligehold.db.DatabaseLayerImplementation; |
import dk.daoas.adressevedligehold.db.DatabaseLayerImplementation; |
18 |
|
import dk.daoas.adressevedligehold.tasks.TaskLogger; |
19 |
import dk.daoas.adressevedligehold.util.DeduplicateHelper; |
import dk.daoas.adressevedligehold.util.DeduplicateHelper; |
20 |
import dk.daoas.adressevedligehold.util.MiscUtils; |
import dk.daoas.adressevedligehold.util.MiscUtils; |
21 |
import dk.daoas.adressevedligehold.util.TimingHelper; |
import dk.daoas.adressevedligehold.util.TimingHelper; |
29 |
|
|
30 |
public class AddressManager { |
public class AddressManager { |
31 |
|
|
32 |
|
private TaskLogger logger = TaskLogger.getInstance(); |
33 |
|
|
34 |
|
|
35 |
List<Address> addressList; |
List<Address> addressList; |
36 |
|
|
37 |
Map<Integer, TreeMap<Short, ArrayList<Address>> > searchStructure; |
Map<Integer, TreeMap<Short, ArrayList<Address>> > searchStructure; |
38 |
|
|
39 |
ArrayList<AddressSourceEntry> afvisteEntries = new ArrayList<AddressSourceEntry>(); |
ArrayList<AddressSourceEntry> rejectedEntries = new ArrayList<AddressSourceEntry>(); |
40 |
|
|
41 |
|
Map<Integer,String> unknownStreets = new TreeMap<Integer, String>(); |
42 |
|
|
43 |
Map<Short,Short> dbkBaneMap = new TreeMap<Short,Short>(); |
Map<Short,Short> dbkBaneMap = new TreeMap<Short,Short>(); |
44 |
|
|
87 |
list.trimToSize(); |
list.trimToSize(); |
88 |
} |
} |
89 |
|
|
90 |
System.out.println("AddressManager ready, elapsed " + timer.getElapsed() + "ms"); |
logger.info("AddressManager ready, elapsed " + timer.getElapsed() + "ms"); |
91 |
|
|
92 |
|
|
93 |
} |
} |
184 |
continue; |
continue; |
185 |
} |
} |
186 |
|
|
187 |
System.out.println(addr.state + ": " + addr.toStringExtended() ); |
logger.info(addr.state + ": " + addr.toStringExtended() ); |
188 |
System.out.println(addr.getRuteString() ); |
logger.info(addr.getRuteString() ); |
189 |
|
|
190 |
if (count++ > 50) |
if (count++ > 50) |
191 |
return; |
return; |
193 |
} |
} |
194 |
|
|
195 |
public void writeBackChanges() { |
public void writeBackChanges() { |
196 |
System.out.println("Writing back changes"); |
logger.info("Writing back changes"); |
197 |
TimingHelper timer = new TimingHelper(); |
TimingHelper timer = new TimingHelper(); |
198 |
|
|
199 |
List<Address> updates = new ArrayList<Address>(1024*1024); |
List<Address> updates = new ArrayList<Address>(1024*1024); |
211 |
DatabaseLayerImplementation db = new DatabaseLayerImplementation(); |
DatabaseLayerImplementation db = new DatabaseLayerImplementation(); |
212 |
|
|
213 |
db.updateAddresses(updates); |
db.updateAddresses(updates); |
214 |
|
db.saveNewAddresses(inserts); |
215 |
|
|
216 |
|
|
217 |
|
|
218 |
System.out.println("Writeback done: elapsed " + timer.getElapsed() + "ms."); |
logger.info("Writeback done: elapsed " + timer.getElapsed() + "ms."); |
219 |
} |
} |
220 |
|
|
221 |
|
|
230 |
private void visitSingle(AddressSourceEntry entry) { |
private void visitSingle(AddressSourceEntry entry) { |
231 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
232 |
if (gade == null) { |
if (gade == null) { |
233 |
|
if (! unknownStreets.containsKey(entry.gadeid)) { |
234 |
|
unknownStreets.put(entry.gadeid, entry.vejnavn); |
235 |
|
} |
236 |
|
|
237 |
createFromEntry(entry); // if we get here there was no match - so we need to create it |
createFromEntry(entry); // if we get here there was no match - so we need to create it |
238 |
return; |
return; |
239 |
} |
} |
243 |
createFromEntry(entry); // if we get here there was no match - so we need to create it |
createFromEntry(entry); // if we get here there was no match - so we need to create it |
244 |
return; |
return; |
245 |
} |
} |
246 |
|
boolean found = false; |
247 |
for (Address addr : litraList) { |
for (Address addr : litraList) { |
248 |
if (addr.husnrbogstav.equals(entry.litra) ) { |
if (addr.husnrbogstav.equals(entry.litra) ) { |
249 |
updateAddress(addr, entry); |
updateAddress(addr, entry); |
250 |
return; //Done for now - no need to look at the rest of the list |
found = true; // 1 visit should be enough but as long as there's duplicates on gadeid+husnr+litra we will visit them all |
251 |
|
//when the issue with duplicates is resolved this should be reverted to a return or break |
252 |
} |
} |
253 |
} |
} |
254 |
|
if (found == false) { |
255 |
createFromEntry(entry); // if we get here there was no match - so we need to create it |
createFromEntry(entry); // if we get here there was no match - so we need to create it |
256 |
|
} |
257 |
} |
} |
258 |
|
|
259 |
private void visitRange(AddressSourceEntry entry) { |
private void visitRange(AddressSourceEntry entry) { |
260 |
|
|
261 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
262 |
if (gade == null) { |
if (gade == null) { |
263 |
System.out.println("[Range] Ukendt gadeID " + entry); |
if (! unknownStreets.containsKey(entry.gadeid)) { |
264 |
|
unknownStreets.put(entry.gadeid, entry.vejnavn); |
265 |
|
} |
266 |
|
|
267 |
|
logger.info("[Range] Ukendt gadeID " + entry); |
268 |
return; |
return; |
269 |
} |
} |
270 |
|
|
303 |
|
|
304 |
private void updateAddress(Address addr, AddressSourceEntry entry) { |
private void updateAddress(Address addr, AddressSourceEntry entry) { |
305 |
if ( addr.distributor != null && addr.distributor.equals(entry.distributor) == false) { |
if ( addr.distributor != null && addr.distributor.equals(entry.distributor) == false) { |
306 |
afvisteEntries.add(entry); |
rejectedEntries.add(entry); |
307 |
System.out.println("Afviser " + entry); |
logger.info("Afviser " + entry); |
308 |
return; |
return; |
309 |
} |
} |
310 |
|
|
326 |
} |
} |
327 |
} |
} |
328 |
} else { |
} else { |
329 |
System.out.println( "Double visit monday " + addr); |
logger.info( "Double visit monday " + addr); |
330 |
} |
} |
331 |
|
|
332 |
} |
} |
348 |
} |
} |
349 |
} |
} |
350 |
} else { |
} else { |
351 |
System.out.println( "Double visit tuesday " + addr); |
logger.info( "Double visit tuesday " + addr); |
352 |
} |
} |
353 |
} |
} |
354 |
|
|
368 |
} |
} |
369 |
} |
} |
370 |
} else { |
} else { |
371 |
System.out.println( "Double visit wednesday " + addr); |
logger.info( "Double visit wednesday " + addr); |
372 |
} |
} |
373 |
} |
} |
374 |
|
|
390 |
} |
} |
391 |
} |
} |
392 |
} else { |
} else { |
393 |
System.out.println( "Double visit thursday " + addr); |
logger.info( "Double visit thursday " + addr); |
394 |
} |
} |
395 |
} |
} |
396 |
|
|
411 |
} |
} |
412 |
} |
} |
413 |
} else { |
} else { |
414 |
System.out.println( "Double visit friday " + addr); |
logger.info( "Double visit friday " + addr); |
415 |
} |
} |
416 |
} |
} |
417 |
|
|
433 |
} |
} |
434 |
} |
} |
435 |
} else { |
} else { |
436 |
System.out.println( "Double visit saturday " + addr); |
logger.info( "Double visit saturday " + addr); |
437 |
} |
} |
438 |
} |
} |
439 |
|
|
454 |
} |
} |
455 |
} |
} |
456 |
} else { |
} else { |
457 |
System.out.println( "Double visit sunday " + addr); |
logger.info( "Double visit sunday " + addr); |
458 |
} |
} |
459 |
} |
} |
460 |
|
|
461 |
|
|
462 |
|
|
463 |
addr.visited = true; |
//addr.visited = true; |
464 |
if (addr.state == AddressState.NOT_CHANGED) { |
if (addr.state == AddressState.NOT_CHANGED) { |
465 |
if (addr.distributor == null) { |
if (addr.distributor == null) { |
466 |
addr.state = AddressState.OPENED; |
addr.state = AddressState.OPENED; |
482 |
|
|
483 |
|
|
484 |
private void createFromEntry(AddressSourceEntry entry) { |
private void createFromEntry(AddressSourceEntry entry) { |
485 |
|
if (entry.husnr >= 1000) { //husnumre i DK må kun være på 3 cifre |
486 |
|
return; |
487 |
|
} |
488 |
|
|
489 |
if (entry.husnr == 999) { |
if (entry.husnr == 999) { |
490 |
return; |
return; |
491 |
} |
} |
492 |
if (entry.kommunekode == 0 || entry.vejkode == 0) { |
if (entry.kommunekode == 0 || entry.vejkode == 0) { |
493 |
return; |
return; |
494 |
} |
} |
495 |
|
if (entry.kommunekode < 100) { |
496 |
|
return; |
497 |
|
} |
498 |
|
|
499 |
|
if (entry.gadeid == 0) { |
500 |
|
return; |
501 |
|
} |
502 |
|
|
503 |
|
String gadeidStr = Integer.toString(entry.gadeid); |
504 |
|
if (gadeidStr.length() != 9) { |
505 |
|
return; |
506 |
|
} |
507 |
|
if (Short.parseShort(gadeidStr.substring(0, 4)) != entry.postnr) { |
508 |
|
return; //gadeid / postnr mismatch |
509 |
|
} |
510 |
|
|
511 |
System.out.println("Opretter adresse ud fra " + entry); |
|
512 |
|
|
513 |
|
logger.info("Opretter adresse ud fra " + entry); |
514 |
|
|
515 |
Address a = new Address(); |
Address a = new Address(); |
516 |
a.state = AddressState.CREATED; |
a.state = AddressState.CREATED; |
523 |
a.husnr = entry.husnr; |
a.husnr = entry.husnr; |
524 |
a.husnrbogstav = entry.litra; |
a.husnrbogstav = entry.litra; |
525 |
a.postnr = entry.postnr; |
a.postnr = entry.postnr; |
526 |
a.visited = true; |
//a.visited = true; |
527 |
|
|
528 |
if (entry.ugedage.mandag) { |
if (entry.ugedage.mandag) { |
529 |
a.ruteMandag = entry.rute; |
a.ruteMandag = entry.rute; |
622 |
break; |
break; |
623 |
case "NS": |
case "NS": |
624 |
bane = 204; |
bane = 204; |
625 |
break; |
break; |
626 |
|
default: |
627 |
|
throw new RuntimeException("Ukendt distributor: " + a.distributor); //Silence findBugs |
628 |
} |
} |
629 |
|
|
630 |
if (bane == null) { |
if (bane == null) { |
631 |
throw new RuntimeException("Ukendt bane for postnr" + a.postnr); |
throw new RuntimeException("Ukendt bane for postnr: " + a.postnr); |
632 |
} |
} |
633 |
|
|
634 |
if (a.dbkBane != bane) { |
if (a.dbkBane != bane) { |
643 |
return Collections.unmodifiableList(addressList); |
return Collections.unmodifiableList(addressList); |
644 |
} |
} |
645 |
|
|
646 |
|
public Map<Integer,String> getUnknownStreets() { |
647 |
|
return Collections.unmodifiableMap( unknownStreets ); |
648 |
|
} |
649 |
|
|
650 |
|
|
651 |
|
|
652 |
public int getAfvistAntal() { |
public int getRejectedCount() { |
653 |
return afvisteEntries.size(); |
return rejectedEntries.size(); |
654 |
} |
} |
655 |
|
|
656 |
} |
} |