|
1
|
// $Id$
|
|
2
|
/**
|
|
3
|
* Copyright (C) 2018 EDIT
|
|
4
|
* European Distributed Institute of Taxonomy
|
|
5
|
* http://www.e-taxonomy.eu
|
|
6
|
*
|
|
7
|
* The contents of this file are subject to the Mozilla Public License Version 1.1
|
|
8
|
* See LICENSE.TXT at the top of this package for the full license terms.
|
|
9
|
*/
|
|
10
|
package eu.etaxonomy.taxeditor.editor.descriptiveDataSet.matrix;
|
|
11
|
|
|
12
|
import java.util.Comparator;
|
|
13
|
import java.util.HashMap;
|
|
14
|
import java.util.List;
|
|
15
|
import java.util.Map;
|
|
16
|
import java.util.UUID;
|
|
17
|
|
|
18
|
import ca.odell.glazedlists.TreeList;
|
|
19
|
import eu.etaxonomy.cdm.api.service.ITaxonNodeService;
|
|
20
|
import eu.etaxonomy.cdm.api.service.dto.RowWrapperDTO;
|
|
21
|
import eu.etaxonomy.cdm.api.service.dto.SpecimenRowWrapperDTO;
|
|
22
|
import eu.etaxonomy.cdm.persistence.dto.DescriptiveDataSetBaseDto;
|
|
23
|
import eu.etaxonomy.cdm.persistence.dto.TaxonNodeDto;
|
|
24
|
import eu.etaxonomy.cdm.persistence.dto.TermDto;
|
|
25
|
import eu.etaxonomy.taxeditor.store.CdmStore;
|
|
26
|
|
|
27
|
/**
|
|
28
|
* The tree format defines how to build the hierarchy path for the
|
|
29
|
* taxon column in the character matrix
|
|
30
|
*
|
|
31
|
* @author pplitzner
|
|
32
|
* @date 23.01.2018
|
|
33
|
*
|
|
34
|
*/
|
|
35
|
public class DescriptionTreeFormat implements TreeList.Format<Object> {
|
|
36
|
|
|
37
|
private TermDto maxRank;
|
|
38
|
|
|
39
|
private Integer deepestTaxonLevel = null;
|
|
40
|
|
|
41
|
private Map<UUID, TaxonNodeDto> uuidToTaxonNodeDtoMap = new HashMap<>();
|
|
42
|
|
|
43
|
public DescriptionTreeFormat(DescriptiveDataSetBaseDto descriptiveDataSet) {
|
|
44
|
this.maxRank = descriptiveDataSet.getMaxRank();
|
|
45
|
}
|
|
46
|
|
|
47
|
@Override
|
|
48
|
public void getPath(List path, Object element) {
|
|
49
|
Integer level = 0;
|
|
50
|
if(element instanceof RowWrapperDTO){
|
|
51
|
//TODO: check for multiple taxon nodes in multiple classifications
|
|
52
|
TaxonNodeDto taxonNode = ((RowWrapperDTO)element).getTaxonNode();
|
|
53
|
//use dto from map cache because the elements have to be
|
|
54
|
//exactly the same for the tree format to work
|
|
55
|
if(uuidToTaxonNodeDtoMap.get(taxonNode.getUuid())!=null){
|
|
56
|
taxonNode = uuidToTaxonNodeDtoMap.get(taxonNode.getUuid());
|
|
57
|
}
|
|
58
|
else{
|
|
59
|
uuidToTaxonNodeDtoMap.put(taxonNode.getUuid(), taxonNode);
|
|
60
|
}
|
|
61
|
level = addPathRecursive(path, taxonNode, level);
|
|
62
|
}
|
|
63
|
if(element instanceof SpecimenRowWrapperDTO){
|
|
64
|
if(deepestTaxonLevel==null){
|
|
65
|
deepestTaxonLevel = level;
|
|
66
|
}
|
|
67
|
else{
|
|
68
|
deepestTaxonLevel = Math.min(level, deepestTaxonLevel);
|
|
69
|
}
|
|
70
|
}
|
|
71
|
path.add(element);
|
|
72
|
}
|
|
73
|
|
|
74
|
private Integer addPathRecursive(List path, TaxonNodeDto node, Integer level){
|
|
75
|
level++;
|
|
76
|
|
|
77
|
if(node!=null){
|
|
78
|
if(maxRank!=null && node.getRankOrderIndex()!=null && node.getRankOrderIndex().equals(maxRank.getOrderIndex())){
|
|
79
|
path.add(node);
|
|
80
|
return level;
|
|
81
|
}
|
|
82
|
TaxonNodeDto parentNodeDto = uuidToTaxonNodeDtoMap.get(node.getParentUUID());
|
|
83
|
if(parentNodeDto==null){
|
|
84
|
parentNodeDto = CdmStore.getService(ITaxonNodeService.class).parentDto(node.getUuid());
|
|
85
|
if(parentNodeDto!=null){
|
|
86
|
uuidToTaxonNodeDtoMap.put(parentNodeDto.getUuid(), parentNodeDto);
|
|
87
|
}
|
|
88
|
}
|
|
89
|
if (parentNodeDto != null){
|
|
90
|
level = addPathRecursive(path, parentNodeDto, level);
|
|
91
|
path.add(node);
|
|
92
|
}
|
|
93
|
|
|
94
|
|
|
95
|
|
|
96
|
}
|
|
97
|
return level;
|
|
98
|
}
|
|
99
|
|
|
100
|
public Integer getDeepestTaxonLevel() {
|
|
101
|
return deepestTaxonLevel;
|
|
102
|
}
|
|
103
|
|
|
104
|
@Override
|
|
105
|
public boolean allowsChildren(Object element) {
|
|
106
|
return true;
|
|
107
|
}
|
|
108
|
|
|
109
|
@Override
|
|
110
|
public Comparator<Object> getComparator(int depth) {
|
|
111
|
return new MatrixRowComparator();
|
|
112
|
}
|
|
113
|
|
|
114
|
}
|