1 |
package dk.daoas.adressevedligehold; |
package dk.daoas.adressevedligehold.coveragefileupload; |
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.coveragefileupload.AddressSourceEntry.EntryType; |
17 |
|
import dk.daoas.adressevedligehold.db.DatabaseCoverageUpdate; |
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 { |
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 |
public void closeUnvisitedAddresses(String distributor, EntryUgedage ugedage) { |
@SuppressWarnings("PMD.CollapsibleIfStatements") |
94 |
|
public int closeUnvisitedAddresses(String distributor, EntryUgedage ugedage) { |
95 |
|
|
96 |
|
int totalClosed = 0; |
97 |
|
|
98 |
for (Address addr : addressList) { |
for (Address addr : addressList) { |
99 |
if (addr.distributor == null) |
if (addr.distributor == null) |
100 |
continue; |
continue; |
169 |
if (addr.state == AddressState.NOT_CHANGED && closedCount>0) { |
if (addr.state == AddressState.NOT_CHANGED && closedCount>0) { |
170 |
addr.state = AddressState.CLOSED; |
addr.state = AddressState.CLOSED; |
171 |
} |
} |
172 |
|
|
173 |
|
if (closedCount>0) { |
174 |
|
totalClosed++; |
175 |
|
} |
176 |
|
|
177 |
} |
} |
178 |
|
|
179 |
|
return totalClosed; |
180 |
} |
} |
181 |
|
|
182 |
|
|
183 |
public void dumpChanged() { |
public void dumpChanged() { |
184 |
int count = 0; |
int count = 0; |
185 |
for (Address addr : addressList) { |
for (Address addr : addressList) { |
202 |
} |
} |
203 |
} |
} |
204 |
|
|
205 |
public void writeBackChanges() { |
public void writeBackChanges() throws Exception{ |
206 |
logger.info("Writing back changes"); |
logger.info("Writing back changes"); |
207 |
TimingHelper timer = new TimingHelper(); |
TimingHelper timer = new TimingHelper(); |
208 |
|
|
218 |
} |
} |
219 |
} |
} |
220 |
|
|
221 |
DatabaseLayerImplementation db = new DatabaseLayerImplementation(); |
DatabaseCoverageUpdate db = new DatabaseCoverageUpdate(); |
222 |
|
|
223 |
db.updateAddresses(updates); |
db.updateAddresses(updates); |
224 |
db.saveNewAddresses(inserts); |
db.saveNewAddresses(inserts); |
240 |
private void visitSingle(AddressSourceEntry entry) { |
private void visitSingle(AddressSourceEntry entry) { |
241 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
242 |
if (gade == null) { |
if (gade == null) { |
243 |
|
/* No need to register unknown streets, since we create all entries that we can |
244 |
if (! unknownStreets.containsKey(entry.gadeid)) { |
if (! unknownStreets.containsKey(entry.gadeid)) { |
245 |
unknownStreets.put(entry.gadeid, entry.vejnavn); |
unknownStreets.put(entry.gadeid, entry.vejnavn); |
246 |
} |
}*/ |
247 |
|
|
248 |
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 |
249 |
return; |
return; |
267 |
} |
} |
268 |
} |
} |
269 |
|
|
270 |
|
@SuppressWarnings("PMD.CollapsibleIfStatements") |
271 |
private void visitRange(AddressSourceEntry entry) { |
private void visitRange(AddressSourceEntry entry) { |
272 |
|
|
273 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
512 |
return; |
return; |
513 |
} |
} |
514 |
|
|
515 |
if (entry.husnr == 999) { |
if (entry.husnr == 999 || entry.husnr == 998) { //frasorter de to højest gyldige husnr - det er typisk special adresser |
516 |
return; |
return; |
517 |
} |
} |
518 |
|
|
534 |
return; |
return; |
535 |
} |
} |
536 |
|
|
537 |
|
if (entry.vejkode > 9999) { |
538 |
|
return; |
539 |
|
} |
540 |
|
|
541 |
if (entry.gadeid == 0) { |
if (entry.gadeid == 0) { |
542 |
return; |
return; |
543 |
} |
} |
554 |
|
|
555 |
logger.info("Opretter adresse ud fra " + entry); |
logger.info("Opretter adresse ud fra " + entry); |
556 |
|
|
557 |
Address a = new Address(); |
Address addr = new Address(); |
558 |
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; |
|
|
} |
|
559 |
|
|
560 |
updateDbkBane(a); |
addr.distributor = entry.distributor; |
561 |
|
addr.gadeid = entry.gadeid; |
562 |
|
addr.kommunekode = entry.kommunekode; |
563 |
|
addr.vejkode = entry.vejkode; |
564 |
|
addr.vejnavn = entry.vejnavn; |
565 |
|
addr.husnr = entry.husnr; |
566 |
|
addr.husnrbogstav = entry.litra; |
567 |
|
addr.postnr = entry.postnr; |
568 |
|
|
|
// Nu er det nye adresse object oprettet - nu skal det gemmes i søge strukturen og totallisten |
|
569 |
|
|
570 |
|
updateAddress(addr, entry); |
571 |
|
|
572 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( a.gadeid ); |
|
573 |
|
// Nu er det nye adresse object oprettet - nu skal det gemmes i søge strukturen og totallisten |
574 |
|
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( addr.gadeid ); |
575 |
|
|
576 |
if (gade == null) { |
if (gade == null) { |
577 |
gade = new TreeMap<Short,ArrayList<Address>>(); |
gade = new TreeMap<Short,ArrayList<Address>>(); |
578 |
searchStructure.put(a.gadeid, gade); |
searchStructure.put(addr.gadeid, gade); |
579 |
} |
} |
580 |
|
|
581 |
ArrayList<Address> litraList = gade.get(a.husnr); |
ArrayList<Address> litraList = gade.get(addr.husnr); |
582 |
if (litraList == null) { |
if (litraList == null) { |
583 |
litraList = new ArrayList<Address>(); |
litraList = new ArrayList<Address>(); |
584 |
gade.put(a.husnr, litraList); |
gade.put(addr.husnr, litraList); |
585 |
} |
} |
586 |
|
|
587 |
litraList.add(a); |
litraList.add(addr); |
588 |
addressList.add(a); |
addressList.add(addr); |
589 |
|
|
590 |
} |
} |
591 |
|
|
609 |
|
|
610 |
private void updateDbkBane(Address a) { |
private void updateDbkBane(Address a) { |
611 |
List<Short> daoBane205 = Arrays.asList( new Short[] {7,10,11,12,12,14,15,16,18,19,20} ); |
List<Short> daoBane205 = Arrays.asList( new Short[] {7,10,11,12,12,14,15,16,18,19,20} ); |
612 |
|
|
613 |
|
|
614 |
Short bane = null; |
Short bane = null; |
615 |
|
|
616 |
switch (a.distributor) { |
switch (a.distributor) { |
619 |
break; |
break; |
620 |
case "DAO": |
case "DAO": |
621 |
String koreliste = MiscUtils.firstNonNull(a.korelisteMandag,a.korelisteLordag, a.korelisteSondag); //DAO har kun 3 dækningstyper |
String koreliste = MiscUtils.firstNonNull(a.korelisteMandag,a.korelisteLordag, a.korelisteSondag); //DAO har kun 3 dækningstyper |
622 |
short first2 = Short.parseShort( koreliste.substring(0,2) ); |
try { |
623 |
if ( daoBane205.contains(first2) ) { |
short first2 = Short.parseShort( koreliste.substring(0,2) ); |
624 |
bane = 205; |
if ( daoBane205.contains(first2) ) { |
625 |
} else if (first2 >= 24 && first2<=30) { |
bane = 205; |
626 |
bane = 201; |
} else if (first2 >= 24 && first2<=30) { |
627 |
} else { |
bane = 201; |
628 |
bane = 202; |
} else { |
629 |
|
bane = 202; |
630 |
|
} |
631 |
|
} catch (NumberFormatException e) { |
632 |
|
throw new RuntimeException("Error parsing koreliste '" + koreliste + "' for " + a); |
633 |
} |
} |
634 |
|
|
635 |
break; |
break; |