程序包 cn.taketoday.bytecode.util

类 ParallelSorter

java.lang.Object

cn.taketoday.bytecode.util.SorterTemplate

cn.taketoday.bytecode.util.ParallelSorter

public abstract class ParallelSorter
extends SorterTemplate

For the efficient sorting of multiple arrays in parallel.

Given two arrays of equal length and varying types, the standard technique for sorting them in parallel is to create a new temporary object for each row, store the objects in a temporary array, sort the array using a custom comparator, and the extract the original values back into their respective arrays. This is wasteful in both time and memory.

This class generates bytecode customized to the particular set of arrays you need to sort, in such a way that both arrays are sorted in-place, simultaneously.

Two sorting algorithms are provided. Quicksort is best when you only need to sort by a single column, as it requires very few comparisons and swaps. Mergesort is best used when sorting multiple columns, as it is a "stable" sort--that is, it does not affect the relative order of equal objects from previous sorts.

The mergesort algorithm here is an "in-place" variant, which while slower, does not require a temporary array.

作者:

Chris Nokleberg

嵌套类概要

嵌套类

修饰符和类型	类	说明
(专用程序包) static class	ParallelSorter.ByteComparer
(专用程序包) static class	ParallelSorter.ComparatorComparer
(专用程序包) static interface	ParallelSorter.Comparer
(专用程序包) static class	ParallelSorter.DoubleComparer
(专用程序包) static class	ParallelSorter.FloatComparer
static class	ParallelSorter.Generator
(专用程序包) static class	ParallelSorter.IntComparer
(专用程序包) static class	ParallelSorter.LongComparer
(专用程序包) static class	ParallelSorter.ObjectComparer
(专用程序包) static class	ParallelSorter.ShortComparer

字段概要

字段

修饰符和类型	字段	说明
protected Object[]	a
private ParallelSorter.Comparer	comparer

构造器概要

构造器

限定符	构造器	说明
protected	ParallelSorter()

方法概要

修饰符和类型	方法	说明
private void	chooseComparer(int index, Comparator cmp)
protected int	compare(int i, int j)
static ParallelSorter	create(Object[] arrays)	Create a new ParallelSorter object for a set of arrays.
private int	len()
void	mergeSort(int index)
void	mergeSort(int index, int lo, int hi)	Sort the arrays using an in-place merge sort.
void	mergeSort(int index, int lo, int hi, Comparator cmp)	Sort the arrays using an in-place merge sort.
void	mergeSort(int index, Comparator cmp)	Sort the arrays using an in-place merge sort.
abstract ParallelSorter	newInstance(Object[] arrays)
void	quickSort(int index)	Sort the arrays using the quicksort algorithm.
void	quickSort(int index, int lo, int hi)	Sort the arrays using the quicksort algorithm.
void	quickSort(int index, int lo, int hi, Comparator cmp)	Sort the arrays using the quicksort algorithm.
void	quickSort(int index, Comparator cmp)	Sort the arrays using the quicksort algorithm.

从类继承的方法 cn.taketoday.bytecode.util.SorterTemplate

mergeSort, quickSort, swap

从类继承的方法 java.lang.Object

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

字段详细资料

a

protected Object[] a

comparer

private ParallelSorter.Comparer comparer

构造器详细资料

ParallelSorter

protected ParallelSorter()

方法详细资料

newInstance

public abstract ParallelSorter newInstance(Object[] arrays)

create

public static ParallelSorter create(Object[] arrays)

Create a new ParallelSorter object for a set of arrays. You may sort the arrays multiple times via the same ParallelSorter object.

参数:

arrays - An array of arrays to sort. The arrays may be a mix of primitive and non-primitive types, but should all be the same length.

len

private int len()

quickSort

public void quickSort(int index)

Sort the arrays using the quicksort algorithm.

参数:

index - array (column) to sort by

quickSort

public void quickSort(int index,
 int lo,
 int hi)

Sort the arrays using the quicksort algorithm.

参数:

index - array (column) to sort by

lo - starting array index (row), inclusive

hi - ending array index (row), exclusive

quickSort

public void quickSort(int index,
 Comparator cmp)

Sort the arrays using the quicksort algorithm.

参数:

index - array (column) to sort by

cmp - Comparator to use if the specified column is non-primitive

quickSort

public void quickSort(int index,
 int lo,
 int hi,
 Comparator cmp)

Sort the arrays using the quicksort algorithm.

参数:

index - array (column) to sort by

lo - starting array index (row), inclusive

hi - ending array index (row), exclusive

cmp - Comparator to use if the specified column is non-primitive

mergeSort

public void mergeSort(int index)

参数:

index - array (column) to sort by

mergeSort

public void mergeSort(int index,
 int lo,
 int hi)

Sort the arrays using an in-place merge sort.

参数:

index - array (column) to sort by

lo - starting array index (row), inclusive

hi - ending array index (row), exclusive

mergeSort

public void mergeSort(int index,
 Comparator cmp)

Sort the arrays using an in-place merge sort.

参数:

index - array (column) to sort by

mergeSort

public void mergeSort(int index,
 int lo,
 int hi,
 Comparator cmp)

Sort the arrays using an in-place merge sort.

参数:

index - array (column) to sort by

lo - starting array index (row), inclusive

hi - ending array index (row), exclusive

cmp - Comparator to use if the specified column is non-primitive

chooseComparer

private void chooseComparer(int index,
 Comparator cmp)

compare

protected int compare(int i,
 int j)

指定者:

compare 在类中 SorterTemplate