Revision 1c114e62
Added by Andreas Müller almost 13 years ago
cdmlib-model/src/main/java/eu/etaxonomy/cdm/model/location/NamedArea.java | ||
---|---|---|
335 | 335 |
|
336 | 336 |
|
337 | 337 |
|
338 |
public NamedAreaNode getHiearchieList(List<NamedArea> areaList){ |
|
338 |
/** |
|
339 |
* This method returns a sorted tree structure which sorts areas by it's level and within the same level |
|
340 |
* alphabetically (TODO to be tested). |
|
341 |
* The structure returned is a tree with alternating nodes that represent an area and an areaLevel. |
|
342 |
* This way also area the have children belonging to different levels can be handled.<BR> |
|
343 |
* The root node is always an empty area node which holds the list of top level areaLevels. |
|
344 |
* AreaLevels with no level defined are handled as if they have a separate level (level="null"). |
|
345 |
* |
|
346 |
* @param areaList |
|
347 |
* @return |
|
348 |
*/ |
|
349 |
public static NamedAreaNode getHiearchieList(List<NamedArea> areaList){ |
|
339 | 350 |
NamedAreaNode result = new NamedAreaNode(); |
340 | 351 |
for (NamedArea area : areaList){ |
341 | 352 |
List<NamedArea> areaHierarchie = area.getAllLevelList(); |
... | ... | |
345 | 356 |
} |
346 | 357 |
|
347 | 358 |
|
348 |
public class LevelNode { |
|
359 |
public static class LevelNode {
|
|
349 | 360 |
NamedAreaLevel level; |
350 | 361 |
List<NamedAreaNode> areaList = new ArrayList<NamedAreaNode>(); |
351 | 362 |
|
... | ... | |
367 | 378 |
} |
368 | 379 |
|
369 | 380 |
public String toString() { |
370 |
return level.getTitleCache(); |
|
381 |
return toString(false, 0); |
|
382 |
} |
|
383 |
public String toString(boolean recursive, int identation) { |
|
384 |
String result = level == null? "" :level.getTitleCache(); |
|
385 |
if (recursive == false){ |
|
386 |
return result; |
|
387 |
}else{ |
|
388 |
int areaSize = this.areaList.size(); |
|
389 |
if (areaSize > 0){ |
|
390 |
result = "\n" + StringUtils.leftPad("", identation) + result + "["; |
|
391 |
} |
|
392 |
boolean isFirst = true; |
|
393 |
for (NamedAreaNode level: this.areaList){ |
|
394 |
if (isFirst){ |
|
395 |
isFirst = false; |
|
396 |
}else{ |
|
397 |
result += ","; |
|
398 |
} |
|
399 |
result += level.toString(recursive, identation+1); |
|
400 |
} |
|
401 |
if (areaSize > 0){ |
|
402 |
result += "]"; |
|
403 |
|
|
404 |
} |
|
405 |
return result; |
|
406 |
} |
|
371 | 407 |
} |
372 | 408 |
|
373 | 409 |
} |
374 | 410 |
|
375 |
public class NamedAreaNode { |
|
411 |
public static class NamedAreaNode {
|
|
376 | 412 |
NamedArea area; |
377 | 413 |
List<LevelNode> levelList = new ArrayList<LevelNode>(); |
378 | 414 |
|
379 | 415 |
public LevelNode getLevelNode(NamedAreaLevel level) { |
380 | 416 |
for (LevelNode node : levelList) { |
381 |
if (node.level.equals(level)) { |
|
417 |
if (node.level != null && node.level.equals(level)) {
|
|
382 | 418 |
return node; |
383 | 419 |
} |
384 | 420 |
} |
... | ... | |
410 | 446 |
} |
411 | 447 |
|
412 | 448 |
public String toString() { |
413 |
if (area == null) { |
|
414 |
return ""; |
|
449 |
return toString(false, 0); |
|
450 |
} |
|
451 |
|
|
452 |
public String toString(boolean recursive, int identation) { |
|
453 |
String result = ""; |
|
454 |
if (area != null) { |
|
455 |
result = area.getTitleCache(); |
|
456 |
} |
|
457 |
if (recursive){ |
|
458 |
int levelSize = this.levelList.size(); |
|
459 |
if (levelSize > 0){ |
|
460 |
result = "\n" + StringUtils.leftPad("", identation) + result + "["; |
|
461 |
} |
|
462 |
boolean isFirst = true; |
|
463 |
for (LevelNode level: this.levelList){ |
|
464 |
if (isFirst){ |
|
465 |
isFirst = false; |
|
466 |
}else{ |
|
467 |
result += ";"; |
|
468 |
} |
|
469 |
result += level.toString(recursive, identation+1); |
|
470 |
} |
|
471 |
if (levelSize > 0){ |
|
472 |
result += "]"; |
|
473 |
|
|
474 |
} |
|
475 |
return result; |
|
476 |
}else{ |
|
477 |
int levelSize = this.levelList.size(); |
|
478 |
return result + "[" + levelSize + " sublevel(s)]"; |
|
415 | 479 |
} |
416 |
return area.getTitleCache(); |
|
417 | 480 |
} |
418 | 481 |
} |
419 | 482 |
|
420 |
private void mergeIntoResult(NamedAreaNode root, |
|
421 |
List<NamedArea> areaHierarchie) { |
|
483 |
private static void mergeIntoResult(NamedAreaNode root, List<NamedArea> areaHierarchie) { |
|
422 | 484 |
if (areaHierarchie.isEmpty()) { |
423 | 485 |
return; |
424 | 486 |
} |
425 | 487 |
NamedArea highestArea = areaHierarchie.get(0); |
426 | 488 |
NamedAreaLevel level = highestArea.getLevel(); |
427 | 489 |
NamedAreaNode namedAreaNode; |
428 |
if (!root.contains(level)) { |
|
490 |
if (! root.contains(level)) {
|
|
429 | 491 |
LevelNode node = root.add(level); |
430 | 492 |
namedAreaNode = node.add(highestArea); |
493 |
//NEW |
|
494 |
// root.area = highestArea; |
|
431 | 495 |
} else { |
432 | 496 |
LevelNode levelNode = root.getLevelNode(level); |
433 | 497 |
namedAreaNode = levelNode.getNamedAreaNode(highestArea); |
... | ... | |
435 | 499 |
namedAreaNode = levelNode.add(highestArea); |
436 | 500 |
} |
437 | 501 |
} |
438 |
List<NamedArea> newList = areaHierarchie.subList(1, areaHierarchie |
|
439 |
.size()); |
|
502 |
List<NamedArea> newList = areaHierarchie.subList(1, areaHierarchie.size()); |
|
440 | 503 |
mergeIntoResult(namedAreaNode, newList); |
441 | 504 |
|
442 | 505 |
} |
Also available in: Unified diff
Tests and first documentation for getHierarchieList