Edit

     * Computes a map treeIndex->rank(sortIndex) for each given taxon node treeIndex. Required by #5957.

     * If the taxon represented by the treeindex is not in the given rank range no record is returned for the given

     * treeindex.

     *

     * @param treeIndex the list of treeIndexes

     * @param minRankOrderIndex min rank

     * @param maxRankOrderIndex max rank

    Map<String, Integer> rankOrderIndexForTreeIndex(List<String> treeIndex, Integer minRankOrderIndex,

     * For a given set of taxon node tree indexes the uuid and title cache of the taxon represented

     * by this treeindex is returned.

     * @param treeIndexSet set of taxon node tree indexes

     * @return map with treeindex and uuidAndTitleCache of the represented taxon

    Map<String, UuidAndTitleCache<?>> taxonUuidsForTreeIndexes(Set<String> treeIndexSet);

        //build treeindex list (or tree)

 * Comparator for treeindexes.

 * Compares the tree indexes node by node, sorted by node number.

 * If one index is shorter than the other one but

        if (treeIndex1.equals(treeIndex2)){

            return 0;

        }

        for (int i=0; i < splits1.length; i++){

            if (splits2.length <= i){

//*********************** toString() ***************************/

    @Override

    public String toString() {

        String result = "taxon:" + (taxonUuid == null? "-":taxonUuid.toString())

                + "; group:" + (groupTaxonUuid == null? "-":groupTaxonUuid.toString())

                + "; group name:" + (groupTaxonName == null? "-":groupTaxonName.toString());

        return result;

    }

// $Id$

/**

* Copyright (C) 2016 EDIT

* European Distributed Institute of Taxonomy

* http://www.e-taxonomy.eu

*

* The contents of this file are subject to the Mozilla Public License Version 1.1

* See LICENSE.TXT at the top of this package for the full license terms.

*/

package eu.etaxonomy.cdm.api.service;

import org.junit.Assert;

import org.junit.Test;

/**

 * @author a.mueller

 * @date 12.09.2016

 *

 */

public class TreeIndexComparatorTest {

    @Test

    public void test() {

        TreeIndexComparator comparator = new TreeIndexComparator();

        //both null

        Assert.assertTrue(0 == comparator.compare(null, null));

        //one null

        Assert.assertTrue(0 > comparator.compare(null, "#t10#10#"));

        Assert.assertTrue(0 < comparator.compare("#t10#10#", null));

        //equal

        Assert.assertTrue(0 == comparator.compare("#t10#10#", "#t10#10#"));

        //same start

        Assert.assertTrue(0 > comparator.compare("#t10#10#", "#t10#10#20#"));

        Assert.assertTrue(0 < comparator.compare("#t10#10#20#", "#t10#10#"));

        //different ends

        Assert.assertTrue(0 > comparator.compare("#t10#10#20#", "#t10#10#30#"));

        Assert.assertTrue(0 < comparator.compare("#t10#10#30#", "#t10#10#20#"));

        //different ends

        Assert.assertTrue(0 > comparator.compare("#t10#10#20#", "#t10#10#30#"));

        Assert.assertTrue(0 > comparator.compare("#t10#10#20#", "#t10#10#30#11"));

        Assert.assertTrue(0 < comparator.compare("#t10#10#30#", "#t10#10#20#"));

        Assert.assertTrue(0 < comparator.compare("#t10#10#30#11", "#t10#10#20#"));

    }

}