Application: gvSIG desktop

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 3

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.gui.beans.swing.treeTable;

/* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana

 *

 * Copyright (C) 2004 IVER T.I. and Generalitat Valenciana.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/* CVS MESSAGES:

 *

 * $Id: MergeSort.java 13136 2007-08-20 08:38:34Z evercher $

 * $Log$

 * Revision 1.1  2007-08-20 08:34:46  evercher

 * He fusionado LibUI con LibUIComponents

 *

 * Revision 1.1  2006/10/23 08:18:39  jorpiell

 * A?adida la clase treetable

 *

 *

 */

/**

 * @author Jorge Piera Llodr? (piera_jor@gva.es)

 */

public abstract class MergeSort extends Object {

    protected Object           toSort[];

    protected Object           swapSpace[];

    public void sort(Object array[]) {

        if(array != null && array.length > 1)

        {

            int             maxLength;

            maxLength = array.length;

            swapSpace = new Object[maxLength];

            toSort = array;

            this.mergeSort(0, maxLength - 1);

            swapSpace = null;

            toSort = null;

        }

    }

    public abstract int compareElementsAt(int beginLoc, int endLoc);

    protected void mergeSort(int begin, int end) {

        if(begin != end)

        {

            int           mid;

            mid = (begin + end) / 2;

            this.mergeSort(begin, mid);

            this.mergeSort(mid + 1, end);

            this.merge(begin, mid, end);

        }

    }

    protected void merge(int begin, int middle, int end) {

        int           firstHalf, secondHalf, count;

        firstHalf = count = begin;

        secondHalf = middle + 1;

        while((firstHalf <= middle) && (secondHalf <= end))

        {

            if(this.compareElementsAt(secondHalf, firstHalf) < 0)

                swapSpace[count++] = toSort[secondHalf++];

            else

                swapSpace[count++] = toSort[firstHalf++];

        }

        if(firstHalf <= middle)

        {

            while(firstHalf <= middle)

                swapSpace[count++] = toSort[firstHalf++];

        }

        else

        {

            while(secondHalf <= end)

                swapSpace[count++] = toSort[secondHalf++];

        }

        for(count = begin;count <= end;count++)

            toSort[count] = swapSpace[count];

    }

}