com.metamatrix.console.util
Class StaticQuickSorter

java.lang.Object
  extended by com.metamatrix.console.util.StaticQuickSorter

public class StaticQuickSorter
extends java.lang.Object

Class with methods to handle a static quicksort. Requires that caller implements Compares interface to order any two given items.


Constructor Summary
StaticQuickSorter()
           
 
Method Summary
static java.lang.Object[] quickSort(java.util.List list)
          Do a quick sort starting from a List and using default comparator.
static java.lang.Object[] quickSort(java.util.List list, Compares comparator)
          Do a quick sort starting from a List.
static java.lang.Object[] quickSort(java.lang.Object[] array)
          Do a quick sort using default comparator.
static java.lang.Object[] quickSort(java.lang.Object[] array, Compares comparator)
          Do a quick sort on an array of objects.
static java.util.Collection quickStringCollectionSort(java.util.Collection strings)
           
static java.lang.String[] quickStringSort(java.lang.String[] array)
          Do a quick sort of a String array, using default comparator.
static int sortedStringArrayIndex(java.lang.String[] array, java.lang.String string)
          Another useful auxilliary method: find the index in a sorted String array of a given string by doing a binary search.
static int stringArrayIndex(java.lang.String[] array, java.lang.String string)
           
static int unsortedStringArrayIndex(java.lang.String[] array, java.lang.String string)
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

StaticQuickSorter

public StaticQuickSorter()
Method Detail

quickSort

public static java.lang.Object[] quickSort(java.lang.Object[] array,
                                           Compares comparator)
Do a quick sort on an array of objects.

Parameters:
array - array of objects
comparator - caller implementation of Compares interface
Returns:
new array representing array in sorted order

quickSort

public static java.lang.Object[] quickSort(java.lang.Object[] array)
Do a quick sort using default comparator.

Parameters:
array - array of objects
Returns:
new array representing array in sorted order

quickSort

public static java.lang.Object[] quickSort(java.util.List list,
                                           Compares comparator)
Do a quick sort starting from a List.

Parameters:
list - List of objects to be sorted
comparator - Caller implementation of Compares interface
Returns:
new array representing items of list in sorted order

quickSort

public static java.lang.Object[] quickSort(java.util.List list)
Do a quick sort starting from a List and using default comparator.

Parameters:
list - List of objects to be sorted
Returns:
new array representing items of list in sorted order

quickStringSort

public static java.lang.String[] quickStringSort(java.lang.String[] array)
Do a quick sort of a String array, using default comparator.

Parameters:
array - String array
Returns:
new array representing items of array in sorted order

quickStringCollectionSort

public static java.util.Collection quickStringCollectionSort(java.util.Collection strings)

sortedStringArrayIndex

public static int sortedStringArrayIndex(java.lang.String[] array,
                                         java.lang.String string)
Another useful auxilliary method: find the index in a sorted String array of a given string by doing a binary search. Returns -1 if not found. Assumes the array is sorted ignoring case.

Parameters:
array - input array which must be sorted ignoring case
string - String to look for in array
Returns:
index of string in array; -1 if not found

unsortedStringArrayIndex

public static int unsortedStringArrayIndex(java.lang.String[] array,
                                           java.lang.String string)

stringArrayIndex

public static int stringArrayIndex(java.lang.String[] array,
                                   java.lang.String string)


Copyright © 2009. All Rights Reserved.