/*
VecQuickSort.java
A Vector implementation of the QuickSort algorithm.
Created: 12 August 1997
Module By: Jonathan Abbey, jonabbey@arlut.utexas.edu
-----------------------------------------------------------------------
Ganymede Directory Management System
Copyright (C) 1996-2010
The University of Texas at Austin
Contact information
Web site: http://www.arlut.utexas.edu/gash2
Author Email: ganymede_author@arlut.utexas.edu
Email mailing list: ganymede@arlut.utexas.edu
US Mail:
Computer Science Division
Applied Research Laboratories
The University of Texas at Austin
PO Box 8029, Austin TX 78713-8029
Telephone: (512) 835-3200
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, see <http://www.gnu.org/licenses/>.
*/
package arlut.csd.Util;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
/*------------------------------------------------------------------------------
class
VecQuickSort
------------------------------------------------------------------------------*/
/**
* QuickSort implementation for Vector. Uses the Comparator
* interface for item comparisons.
*
* @version $Id$
* @author Jonathan Abbey, jonabbey@arlut.utexas.edu, ARL:UT
*/
public class VecQuickSort implements Comparator {
List objects;
Comparator comparator;
/* -- */
/**
*
* VecQuickSort constructor.
*
* @param objects List of objects to be sorted in place
* @param comparator Comparator object.. if null, standard string compare
* will be done.
*
*/
public VecQuickSort(List objects, Comparator comparator)
{
this.objects = objects;
if (comparator == null)
{
this.comparator = this;
}
else
{
this.comparator = comparator;
}
}
/**
* Sort the elements
*/
public void sort()
{
synchronized (objects)
{
Object ary[] = objects.toArray();
java.util.Arrays.sort(ary, this.comparator);
for (int i = 0; i < ary.length; i++)
{
objects.set(i, ary[i]);
}
}
}
/**
* Default comparator, does a string comparison on the
* toString() output of the objects for ordering.
*/
public int compare(Object a, Object b)
{
return a.toString().compareToIgnoreCase(b.toString());
}
}