org.exist.util
Class FastQSort
java.lang.Object
org.exist.util.FastQSort
public final class FastQSort
- extends Object
This class implements a version
of the Introspective Sort Algorithm.
Reference: David R. Musser
"Introspective Sorting and Selection Algorithms"
Software--Practice and Experience, (8): 983-993 (1997)
The implementation is mainly inspired
on the article describing the algorithm,
but also in the work of Michael
Maniscalco in C++. It is also slightly
based on the previous implementation of
FastQSort in eXist.
http://www.cs.rpi.edu/~musser/
http://www.cs.rpi.edu/~musser/gp/introsort.ps
http://www.michael-maniscalco.com/sorting.htm
- Author:
- José María Fernández
Method Summary |
static void |
main(String[] args)
|
static void |
sort(Comparable[] a,
int lo,
int hi)
|
static void |
sort(Comparable[] a,
int lo,
int hi,
int[] b)
|
static void |
sort(List a,
int lo,
int hi)
|
static void |
sort(long[] a,
int lo,
int hi,
Object[] b)
|
static void |
sort(NodeProxy[] a,
int lo,
int hi)
|
static void |
sort(Object[] a,
Comparator c,
int lo,
int hi)
|
static void |
sortByNodeId(NodeProxy[] a,
int lo,
int hi)
|
FastQSort
public FastQSort()
sort
public static void sort(Comparable[] a,
int lo,
int hi)
sort
public static void sort(Comparable[] a,
int lo,
int hi,
int[] b)
sort
public static void sort(Object[] a,
Comparator c,
int lo,
int hi)
sort
public static void sort(List a,
int lo,
int hi)
sort
public static void sort(NodeProxy[] a,
int lo,
int hi)
sortByNodeId
public static void sortByNodeId(NodeProxy[] a,
int lo,
int hi)
sort
public static void sort(long[] a,
int lo,
int hi,
Object[] b)
main
public static void main(String[] args)
throws Exception
- Throws:
Exception
Copyright (C) Wolfgang Meier. All rights reserved.