1 |
package dk.daoas.adressevedligehold; |
package dk.daoas.adressevedligehold.fileupload; |
2 |
|
|
3 |
import java.sql.SQLException; |
import java.sql.SQLException; |
4 |
import java.util.ArrayList; |
import java.util.ArrayList; |
11 |
|
|
12 |
import org.apache.commons.lang3.StringUtils; |
import org.apache.commons.lang3.StringUtils; |
13 |
|
|
|
import dk.daoas.adressevedligehold.AddressSourceEntry.EntryType; |
|
14 |
import dk.daoas.adressevedligehold.beans.Address; |
import dk.daoas.adressevedligehold.beans.Address; |
15 |
import dk.daoas.adressevedligehold.beans.Address.AddressState; |
import dk.daoas.adressevedligehold.beans.Address.AddressState; |
16 |
import dk.daoas.adressevedligehold.db.DatabaseLayerImplementation; |
import dk.daoas.adressevedligehold.db.DatabaseCoverageUpdate; |
17 |
|
import dk.daoas.adressevedligehold.fileupload.AddressSourceEntry.EntryType; |
18 |
import dk.daoas.adressevedligehold.tasks.TaskLogger; |
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; |
22 |
|
|
23 |
/* |
/* |
24 |
* TODO: håndtering af entry dupletter ! (+ rapportering af dem) |
* |
|
|
|
|
|
|
|
|
|
25 |
*/ |
*/ |
26 |
|
|
27 |
public class AddressManager { |
public class AddressManager { |
28 |
|
|
29 |
private TaskLogger logger = TaskLogger.getInstance(); |
private TaskLogger logger = TaskLogger.getInstance(); |
30 |
|
|
31 |
|
private int duplicateCount; |
32 |
|
|
33 |
List<Address> addressList; |
List<Address> addressList; |
34 |
|
|
41 |
Map<Short,Short> dbkBaneMap = new TreeMap<Short,Short>(); |
Map<Short,Short> dbkBaneMap = new TreeMap<Short,Short>(); |
42 |
|
|
43 |
public AddressManager() throws SQLException { |
public AddressManager() throws SQLException { |
44 |
DatabaseLayerImplementation db = new DatabaseLayerImplementation(); |
DatabaseCoverageUpdate db = new DatabaseCoverageUpdate(); |
45 |
|
|
46 |
searchStructure = new TreeMap<Integer, TreeMap<Short, ArrayList<Address>> >(); |
searchStructure = new TreeMap<Integer, TreeMap<Short, ArrayList<Address>> >(); |
47 |
|
|
89 |
|
|
90 |
|
|
91 |
} |
} |
92 |
|
|
93 |
|
@SuppressWarnings("PMD.CollapsibleIfStatements") |
94 |
public void closeUnvisitedAddresses(String distributor, EntryUgedage ugedage) { |
public void closeUnvisitedAddresses(String distributor, EntryUgedage ugedage) { |
95 |
for (Address addr : addressList) { |
for (Address addr : addressList) { |
96 |
if (addr.distributor == null) |
if (addr.distributor == null) |
207 |
} |
} |
208 |
} |
} |
209 |
|
|
210 |
DatabaseLayerImplementation db = new DatabaseLayerImplementation(); |
DatabaseCoverageUpdate db = new DatabaseCoverageUpdate(); |
211 |
|
|
212 |
db.updateAddresses(updates); |
db.updateAddresses(updates); |
213 |
db.saveNewAddresses(inserts); |
db.saveNewAddresses(inserts); |
229 |
private void visitSingle(AddressSourceEntry entry) { |
private void visitSingle(AddressSourceEntry entry) { |
230 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
231 |
if (gade == null) { |
if (gade == null) { |
232 |
|
/* No need to register unknown streets, since we create all entries that we can |
233 |
if (! unknownStreets.containsKey(entry.gadeid)) { |
if (! unknownStreets.containsKey(entry.gadeid)) { |
234 |
unknownStreets.put(entry.gadeid, entry.vejnavn); |
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; |
256 |
} |
} |
257 |
} |
} |
258 |
|
|
259 |
|
@SuppressWarnings("PMD.CollapsibleIfStatements") |
260 |
private void visitRange(AddressSourceEntry entry) { |
private void visitRange(AddressSourceEntry entry) { |
261 |
|
|
262 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
327 |
} |
} |
328 |
} |
} |
329 |
} else { |
} else { |
330 |
|
duplicateCount++; |
331 |
logger.info( "Double visit monday " + addr); |
logger.info( "Double visit monday " + addr); |
332 |
|
return; // if the entry is duplicate on one day that it covers - then it will be as well on all the othters |
333 |
} |
} |
334 |
|
|
335 |
} |
} |
351 |
} |
} |
352 |
} |
} |
353 |
} else { |
} else { |
354 |
|
duplicateCount++; |
355 |
logger.info( "Double visit tuesday " + addr); |
logger.info( "Double visit tuesday " + addr); |
356 |
|
return; // if the entry is duplicate on one day that it covers - then it will be as well on all the othters |
357 |
} |
} |
358 |
} |
} |
359 |
|
|
373 |
} |
} |
374 |
} |
} |
375 |
} else { |
} else { |
376 |
|
duplicateCount++; |
377 |
logger.info( "Double visit wednesday " + addr); |
logger.info( "Double visit wednesday " + addr); |
378 |
|
return; // if the entry is duplicate on one day that it covers - then it will be as well on all the othters |
379 |
} |
} |
380 |
} |
} |
381 |
|
|
397 |
} |
} |
398 |
} |
} |
399 |
} else { |
} else { |
400 |
|
duplicateCount++; |
401 |
logger.info( "Double visit thursday " + addr); |
logger.info( "Double visit thursday " + addr); |
402 |
|
return; // if the entry is duplicate on one day that it covers - then it will be as well on all the othters |
403 |
} |
} |
404 |
} |
} |
405 |
|
|
420 |
} |
} |
421 |
} |
} |
422 |
} else { |
} else { |
423 |
|
duplicateCount++; |
424 |
logger.info( "Double visit friday " + addr); |
logger.info( "Double visit friday " + addr); |
425 |
|
return; // if the entry is duplicate on one day that it covers - then it will be as well on all the othters |
426 |
} |
} |
427 |
} |
} |
428 |
|
|
444 |
} |
} |
445 |
} |
} |
446 |
} else { |
} else { |
447 |
|
duplicateCount++; |
448 |
logger.info( "Double visit saturday " + addr); |
logger.info( "Double visit saturday " + addr); |
449 |
|
return; // if the entry is duplicate on one day that it covers - then it will be as well on all the othters |
450 |
} |
} |
451 |
} |
} |
452 |
|
|
467 |
} |
} |
468 |
} |
} |
469 |
} else { |
} else { |
470 |
|
duplicateCount++; |
471 |
logger.info( "Double visit sunday " + addr); |
logger.info( "Double visit sunday " + addr); |
472 |
|
return; // if the entry is duplicate on one day that it covers - then it will be as well on all the othters |
473 |
} |
} |
474 |
} |
} |
475 |
|
|
497 |
|
|
498 |
|
|
499 |
private void createFromEntry(AddressSourceEntry entry) { |
private void createFromEntry(AddressSourceEntry entry) { |
500 |
if (entry.husnr == 999) { |
if (entry.husnr >= 1000) { //husnumre i DK må kun være på 3 cifre |
501 |
return; |
return; |
502 |
} |
} |
503 |
|
|
504 |
|
if (entry.husnr == 999 || entry.husnr == 998) { //frasorter de to højest gyldige husnr - det er typisk special adresser |
505 |
|
return; |
506 |
|
} |
507 |
|
|
508 |
|
if (entry.litra.length() > 1) { //litra må kun være på 1 tegn |
509 |
|
return; |
510 |
|
} |
511 |
|
if (entry.litra.length() == 1) { |
512 |
|
char litra = entry.litra.charAt(0); |
513 |
|
if ( Character.isLetter(litra) == false ) { |
514 |
|
return; |
515 |
|
} |
516 |
|
|
517 |
|
} |
518 |
|
|
519 |
if (entry.kommunekode == 0 || entry.vejkode == 0) { |
if (entry.kommunekode == 0 || entry.vejkode == 0) { |
520 |
return; |
return; |
521 |
} |
} |
523 |
return; |
return; |
524 |
} |
} |
525 |
|
|
526 |
if (entry.gadeid == 0) { |
if (entry.vejkode > 9999) { |
527 |
return; |
return; |
528 |
} |
} |
529 |
|
|
530 |
|
if (entry.gadeid == 0) { |
531 |
|
return; |
532 |
|
} |
533 |
|
|
534 |
String gadeidStr = Integer.toString(entry.gadeid); |
String gadeidStr = Integer.toString(entry.gadeid); |
535 |
if (gadeidStr.length() != 9) { |
if (gadeidStr.length() != 9) { |
536 |
return; |
return; |
543 |
|
|
544 |
logger.info("Opretter adresse ud fra " + entry); |
logger.info("Opretter adresse ud fra " + entry); |
545 |
|
|
546 |
Address a = new Address(); |
Address addr = new Address(); |
547 |
a.state = AddressState.CREATED; |
addr.state = AddressState.CREATED; |
|
|
|
|
a.distributor = entry.distributor; |
|
|
a.gadeid = entry.gadeid; |
|
|
a.kommunekode = entry.kommunekode; |
|
|
a.vejkode = entry.vejkode; |
|
|
a.vejnavn = entry.vejnavn; |
|
|
a.husnr = entry.husnr; |
|
|
a.husnrbogstav = entry.litra; |
|
|
a.postnr = entry.postnr; |
|
|
//a.visited = true; |
|
|
|
|
|
if (entry.ugedage.mandag) { |
|
|
a.ruteMandag = entry.rute; |
|
|
a.korelisteMandag = entry.koreliste; |
|
|
} |
|
|
if (entry.ugedage.tirsdag) { |
|
|
a.ruteTirsdag = entry.rute; |
|
|
a.korelisteTirsdag = entry.koreliste; |
|
|
} |
|
|
if (entry.ugedage.onsdag) { |
|
|
a.ruteOnsdag = entry.rute; |
|
|
a.korelisteOnsdag = entry.koreliste; |
|
|
} |
|
|
if (entry.ugedage.torsdag) { |
|
|
a.ruteTorsdag = entry.rute; |
|
|
a.korelisteTorsdag = entry.koreliste; |
|
|
} |
|
|
if (entry.ugedage.fredag) { |
|
|
a.ruteFredag = entry.rute; |
|
|
a.korelisteFredag = entry.koreliste; |
|
|
} |
|
|
if (entry.ugedage.lordag) { |
|
|
a.ruteLordag = entry.rute; |
|
|
a.korelisteLordag = entry.koreliste; |
|
|
} |
|
|
if (entry.ugedage.sondag) { |
|
|
a.ruteSondag = entry.rute; |
|
|
a.korelisteLordag = entry.koreliste; |
|
|
} |
|
548 |
|
|
549 |
updateDbkBane(a); |
addr.distributor = entry.distributor; |
550 |
|
addr.gadeid = entry.gadeid; |
551 |
|
addr.kommunekode = entry.kommunekode; |
552 |
|
addr.vejkode = entry.vejkode; |
553 |
|
addr.vejnavn = entry.vejnavn; |
554 |
|
addr.husnr = entry.husnr; |
555 |
|
addr.husnrbogstav = entry.litra; |
556 |
|
addr.postnr = entry.postnr; |
557 |
|
|
|
// Nu er det nye adresse object oprettet - nu skal det gemmes i søge strukturen og totallisten |
|
558 |
|
|
559 |
|
updateAddress(addr, entry); |
560 |
|
|
561 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( a.gadeid ); |
|
562 |
|
// Nu er det nye adresse object oprettet - nu skal det gemmes i søge strukturen og totallisten |
563 |
|
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( addr.gadeid ); |
564 |
|
|
565 |
if (gade == null) { |
if (gade == null) { |
566 |
gade = new TreeMap<Short,ArrayList<Address>>(); |
gade = new TreeMap<Short,ArrayList<Address>>(); |
567 |
searchStructure.put(a.gadeid, gade); |
searchStructure.put(addr.gadeid, gade); |
568 |
} |
} |
569 |
|
|
570 |
ArrayList<Address> litraList = gade.get(a.husnr); |
ArrayList<Address> litraList = gade.get(addr.husnr); |
571 |
if (litraList == null) { |
if (litraList == null) { |
572 |
litraList = new ArrayList<Address>(); |
litraList = new ArrayList<Address>(); |
573 |
gade.put(a.husnr, litraList); |
gade.put(addr.husnr, litraList); |
574 |
} |
} |
575 |
|
|
576 |
litraList.add(a); |
litraList.add(addr); |
577 |
addressList.add(a); |
addressList.add(addr); |
578 |
|
|
579 |
} |
} |
580 |
|
|
648 |
return Collections.unmodifiableMap( unknownStreets ); |
return Collections.unmodifiableMap( unknownStreets ); |
649 |
} |
} |
650 |
|
|
651 |
|
public int getDuplicateCount() { |
652 |
|
return duplicateCount; |
653 |
|
} |
654 |
|
|
655 |
public int getRejectedCount() { |
public int getRejectedCount() { |
656 |
return rejectedEntries.size(); |
return rejectedEntries.size(); |