233 |
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 |
234 |
return; |
return; |
235 |
} |
} |
236 |
|
boolean found = false; |
237 |
for (Address addr : litraList) { |
for (Address addr : litraList) { |
238 |
if (addr.husnrbogstav.equals(entry.litra) ) { |
if (addr.husnrbogstav.equals(entry.litra) ) { |
239 |
updateAddress(addr, entry); |
updateAddress(addr, entry); |
240 |
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 |
241 |
|
//when the issue with duplicates is resolved this should be reverted to a return or break |
242 |
} |
} |
243 |
} |
} |
244 |
|
if (found == false) { |
245 |
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 |
246 |
|
} |
247 |
} |
} |
248 |
|
|
249 |
private void visitRange(AddressSourceEntry entry) { |
private void visitRange(AddressSourceEntry entry) { |
595 |
break; |
break; |
596 |
case "NS": |
case "NS": |
597 |
bane = 204; |
bane = 204; |
598 |
break; |
break; |
599 |
|
default: |
600 |
|
throw new RuntimeException("Ukendt distributor" + a.distributor); //Silence findBugs |
601 |
} |
} |
602 |
|
|
603 |
if (bane == null) { |
if (bane == null) { |