227 |
private void visitSingle(AddressSourceEntry entry) { |
private void visitSingle(AddressSourceEntry entry) { |
228 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
229 |
if (gade == null) { |
if (gade == null) { |
230 |
unknownStreets.putIfAbsent(entry.gadeid, entry.vejnavn); |
if (! unknownStreets.containsKey(entry.gadeid)) { |
231 |
|
unknownStreets.put(entry.gadeid, entry.vejnavn); |
232 |
|
} |
233 |
|
|
234 |
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 |
235 |
return; |
return; |
236 |
} |
} |
257 |
|
|
258 |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
TreeMap<Short, ArrayList<Address>> gade = searchStructure.get( entry.gadeid ); |
259 |
if (gade == null) { |
if (gade == null) { |
260 |
unknownStreets.putIfAbsent(entry.gadeid, entry.vejnavn); |
if (! unknownStreets.containsKey(entry.gadeid)) { |
261 |
|
unknownStreets.put(entry.gadeid, entry.vejnavn); |
262 |
|
} |
263 |
|
|
264 |
System.out.println("[Range] Ukendt gadeID " + entry); |
System.out.println("[Range] Ukendt gadeID " + entry); |
265 |
return; |
return; |
266 |
} |
} |