com.carrotsearch.hppcrt.sorting

Class IntSort

java.lang.Object

com.carrotsearch.hppcrt.sorting.IntSort

@Generated(date="2017-07-11T19:16:33+0200",
           value="KTypeSort.java")
public final class IntSort
extends java.lang.Object

Utility class gathering sorting algorithms for ints containers. It is a replacement for Arrays sorting routines, with memory and speed guarantees documented in Javadoc.

Method Summary

Modifier and Type	Method and Description
static void	quicksort(int[] table) In-place sort by dual-pivot quicksort a entire array of of naturally Comparable ints This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(int[] table, IntComparator comp) In-place sort by dual-pivot quicksort an entire array of ints using a IntComparator * This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(int[] table, int beginIndex, int endIndex) In-place sort by dual-pivot quicksort an array of naturally comparable ints from [beginIndex, endIndex[ This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(int[] table, int beginIndex, int endIndex, IntComparator comp) In-place sort by dual-pivot quicksort an array of ints from [beginIndex, endIndex[ using a IntComparator * This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(IntIndexedContainer table) In-place sort by dual-pivot quicksort a entire IntIndexedContainer of naturally Comparable ints This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(IntIndexedContainer table, IntComparator comp) In-place sort by dual-pivot quicksort an entire generic IntIndexedContainer using a IntComparator * This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(IntIndexedContainer table, int beginIndex, int endIndex) In-place sort by dual-pivot quicksort a IntIndexedContainer of naturally Comparable ints from [beginIndex, endIndex[ This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(IntIndexedContainer table, int beginIndex, int endIndex, IntComparator comp) In-place sort by dual-pivot quicksort a generic IntIndexedContainer from [beginIndex, endIndex[ using a IntComparator * This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *

Methods inherited from class java.lang.Object

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

Method Detail

quicksort

public static void quicksort(int[] table,
                             int beginIndex,
                             int endIndex)

In-place sort by dual-pivot quicksort an array of naturally comparable ints from [beginIndex, endIndex[

This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *

quicksort

public static void quicksort(int[] table)

In-place sort by dual-pivot quicksort a entire array of of naturally Comparable ints

This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *

quicksort

public static void quicksort(IntIndexedContainer table,
                             int beginIndex,
                             int endIndex)

In-place sort by dual-pivot quicksort a IntIndexedContainer of naturally Comparable ints from [beginIndex, endIndex[

This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *

quicksort

public static void quicksort(IntIndexedContainer table)

In-place sort by dual-pivot quicksort a entire IntIndexedContainer of naturally Comparable ints

This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *

quicksort

public static void quicksort(int[] table,
                             int beginIndex,
                             int endIndex,
                             IntComparator comp)

In-place sort by dual-pivot quicksort an array of ints from [beginIndex, endIndex[ using a IntComparator *

This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *

quicksort

public static void quicksort(int[] table,
                             IntComparator comp)

In-place sort by dual-pivot quicksort an entire array of ints using a IntComparator *

This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *

quicksort

public static void quicksort(IntIndexedContainer table,
                             int beginIndex,
                             int endIndex,
                             IntComparator comp)

In-place sort by dual-pivot quicksort a generic IntIndexedContainer from [beginIndex, endIndex[ using a IntComparator *

This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *

quicksort

public static void quicksort(IntIndexedContainer table,
                             IntComparator comp)

In-place sort by dual-pivot quicksort an entire generic IntIndexedContainer using a IntComparator *

This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *