com.carrotsearch.hppcrt.sorting

Class ByteSort

java.lang.Object

com.carrotsearch.hppcrt.sorting.ByteSort

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

Utility class gathering sorting algorithms for bytes 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(byte[] table) In-place sort by dual-pivot quicksort a entire array of of naturally Comparable bytes This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(byte[] table, ByteComparator comp) In-place sort by dual-pivot quicksort an entire array of bytes using a ByteComparator * This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(byte[] table, int beginIndex, int endIndex) In-place sort by dual-pivot quicksort an array of naturally comparable bytes from [beginIndex, endIndex[ This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(byte[] table, int beginIndex, int endIndex, ByteComparator comp) In-place sort by dual-pivot quicksort an array of bytes from [beginIndex, endIndex[ using a ByteComparator * This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(ByteIndexedContainer table) In-place sort by dual-pivot quicksort a entire ByteIndexedContainer of naturally Comparable bytes This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(ByteIndexedContainer table, ByteComparator comp) In-place sort by dual-pivot quicksort an entire generic ByteIndexedContainer using a ByteComparator * This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(ByteIndexedContainer table, int beginIndex, int endIndex) In-place sort by dual-pivot quicksort a ByteIndexedContainer of naturally Comparable bytes from [beginIndex, endIndex[ This routine uses Dual-pivot Quicksort, from [Vladimir Yaroslavskiy 2009] *
static void	quicksort(ByteIndexedContainer table, int beginIndex, int endIndex, ByteComparator comp) In-place sort by dual-pivot quicksort a generic ByteIndexedContainer from [beginIndex, endIndex[ using a ByteComparator * 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(byte[] table,
                             int beginIndex,
                             int endIndex)

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

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

quicksort

public static void quicksort(byte[] table)

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

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

quicksort

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

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

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

quicksort

public static void quicksort(ByteIndexedContainer table)

In-place sort by dual-pivot quicksort a entire ByteIndexedContainer of naturally Comparable bytes

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

quicksort

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

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

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

quicksort

public static void quicksort(byte[] table,
                             ByteComparator comp)

In-place sort by dual-pivot quicksort an entire array of bytes using a ByteComparator *

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

quicksort

public static void quicksort(ByteIndexedContainer table,
                             int beginIndex,
                             int endIndex,
                             ByteComparator comp)

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

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

quicksort

public static void quicksort(ByteIndexedContainer table,
                             ByteComparator comp)

In-place sort by dual-pivot quicksort an entire generic ByteIndexedContainer using a ByteComparator *

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