Package org.eclipse.collections.impl.utility.primitive

Class ShortQuickSort

java.lang.Object

org.eclipse.collections.impl.utility.primitive.ShortQuickSort

public final class ShortQuickSort
extends java.lang.Object

ShortQuickSort is an implementation of the Quick Sort algorithm as described in Donald Knuth's TAOCP with some optimizations. It supports indirect array sorting based on primitive comparators and/or key values extracted from the array values if a sort order other thant the natural one of the array elements is required. This file was automatically generated from template file primitiveSort.stg.

Field Summary

Fields

Modifier and Type	Field	Description
private static int	SORT_SMALL_SIZE

Constructor Summary

Constructors

Modifier	Constructor	Description
private	ShortQuickSort()

Method Summary

Modifier and Type	Method	Description
private static void	insertionSort(short[] array, int left, int right, ShortComparator comparator)
static void	sort(short[] array, int left, int right, ShortComparator comparator)
private static void	swap(short[] array, int i1, int i2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

SORT_SMALL_SIZE

private static final int SORT_SMALL_SIZE

See Also:

Constant Field Values

Constructor Detail

ShortQuickSort

private ShortQuickSort()

Method Detail

sort

public static void sort(short[] array,
                        int left,
                        int right,
                        ShortComparator comparator)

insertionSort

private static void insertionSort(short[] array,
                                  int left,
                                  int right,
                                  ShortComparator comparator)

swap

private static void swap(short[] array,
                         int i1,
                         int i2)