BGBM BDI Projects
/
cdmlib.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
ref #6072 test missing entity in webservice
[cdmlib.git]
/
cdmlib-services
/
src
/
main
/
java
/
eu
/
etaxonomy
/
cdm
/
api
/
service
/
TreeIndexComparator.java
diff --git
a/cdmlib-services/src/main/java/eu/etaxonomy/cdm/api/service/TreeIndexComparator.java
b/cdmlib-services/src/main/java/eu/etaxonomy/cdm/api/service/TreeIndexComparator.java
index 35c7be89a574c72e19a5744c052f14fff9dd40b8..3fa24c6aa19ee995adc3f4f89864476fc8aa0725 100644
(file)
--- a/
cdmlib-services/src/main/java/eu/etaxonomy/cdm/api/service/TreeIndexComparator.java
+++ b/
cdmlib-services/src/main/java/eu/etaxonomy/cdm/api/service/TreeIndexComparator.java
@@
-17,6
+17,9
@@
import eu.etaxonomy.cdm.model.common.ITreeNode;
* @author a.mueller
* @date 05.07.2016
*
* @author a.mueller
* @date 05.07.2016
*
+ * Comparator for treeindexes.
+ * Compares the tree indexes node by node, sorted by node number.
+ * If one index is shorter than the other one but
*/
public class TreeIndexComparator implements Comparator<String>{
*/
public class TreeIndexComparator implements Comparator<String>{
@@
-29,12
+32,16
@@
public class TreeIndexComparator implements Comparator<String>{
}else if (treeIndex2 == null){
return 1;
}
}else if (treeIndex2 == null){
return 1;
}
+ if (treeIndex1.equals(treeIndex2)){
+ return 0;
+ }
+
String[] splits1 = treeIndex1.split(ITreeNode.separator);
String[] splits2 = treeIndex2.split(ITreeNode.separator);
String[] splits1 = treeIndex1.split(ITreeNode.separator);
String[] splits2 = treeIndex2.split(ITreeNode.separator);
- for (int i=0; i
<
splits1.length; i++){
- if (splits2.length < i){
+ for (int i=0; i
<
splits1.length; i++){
+ if (splits2.length <
=
i){
return 1;
}
int c = splits1[i].compareTo(splits2[i]);
return 1;
}
int c = splits1[i].compareTo(splits2[i]);