33 |
|
|
34 |
Map<Integer, TreeMap<Short, ArrayList<Address>> > searchStructure; |
Map<Integer, TreeMap<Short, ArrayList<Address>> > searchStructure; |
35 |
|
|
36 |
ArrayList<AddressSourceEntry> afvisteEntries = new ArrayList<AddressSourceEntry>(); |
ArrayList<AddressSourceEntry> rejectedEntries = new ArrayList<AddressSourceEntry>(); |
37 |
|
|
38 |
Map<Short,Short> dbkBaneMap = new TreeMap<Short,Short>(); |
Map<Short,Short> dbkBaneMap = new TreeMap<Short,Short>(); |
39 |
|
|
289 |
|
|
290 |
private void updateAddress(Address addr, AddressSourceEntry entry) { |
private void updateAddress(Address addr, AddressSourceEntry entry) { |
291 |
if ( addr.distributor != null && addr.distributor.equals(entry.distributor) == false) { |
if ( addr.distributor != null && addr.distributor.equals(entry.distributor) == false) { |
292 |
afvisteEntries.add(entry); |
rejectedEntries.add(entry); |
293 |
System.out.println("Afviser " + entry); |
System.out.println("Afviser " + entry); |
294 |
return; |
return; |
295 |
} |
} |
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) { |
618 |
|
|
619 |
|
|
620 |
|
|
621 |
public int getAfvistAntal() { |
public int getRejectedCount() { |
622 |
return afvisteEntries.size(); |
return rejectedEntries.size(); |
623 |
} |
} |
624 |
|
|
625 |
} |
} |