Package io.deephaven.engine.table.impl.sort.timsort

Class DoubleTimsortDescendingKernel

java.lang.Object

io.deephaven.engine.table.impl.sort.timsort.DoubleTimsortDescendingKernel

public class DoubleTimsortDescendingKernel
extends Object

This implements a timsort kernel for Doubles.

Python and Wikipedia do a decent job of describing the algorithm.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	DoubleTimsortDescendingKernel.DoubleSortKernelContext<ATTR extends Any>

Method Summary

Modifier and Type	Method	Description
static <ATTR extends Any> DoubleTimsortDescendingKernel.DoubleSortKernelContext<ATTR>	createContext(int size)
static <ATTR extends Any> void	sort(DoubleTimsortDescendingKernel.DoubleSortKernelContext<ATTR> context, WritableDoubleChunk<ATTR> valuesToSort)	Sort the values in valuesToSort permuting the indexKeys chunk in the same way.

Methods inherited from class java.lang.Object

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

Method Details

createContext

public static <ATTR extends Any>
DoubleTimsortDescendingKernel.DoubleSortKernelContext<ATTR> createContext(int size)

sort

public static <ATTR extends Any> void sort(DoubleTimsortDescendingKernel.DoubleSortKernelContext<ATTR> context,
 WritableDoubleChunk<ATTR> valuesToSort)

Sort the values in valuesToSort permuting the indexKeys chunk in the same way.

The offsetsIn chunk is contains the offset of runs to sort in indexKeys; and the lengthsIn contains the length of the runs. This allows the kernel to be used for a secondary column sort, chaining it together with fewer runs sorted on each pass.