| Modifier and Type | Class and Description |
|---|---|
| public class | |
| pack-priv class | |
| public class | MergeScan
A sort scan that is capable of merging as many merge runs as will fit in the passed-in sort buffer. |
| public class | MergeScanRowSource
Wrapping the output of a MergeScan in a RowSource for the benefit of the createAndLoadConglomerate and loadConglomerate interface. |
| pack-priv class | MergeSort
A sort implementation which does the sort in-memory if it can, but which can do an external merge sort so that it can sort an arbitrary number of rows. |
| pack-priv class | MergeSortInfo
This object provides performance information related to a sort. |
| pack-priv class | Node
A node in a balanced binary tree. |
| pack-priv class | NodeAllocator
NodeAllocator manages an array of nodes which can be reused. |
| public abstract class | Scan
Abstract base class for all sort classes which return rows from the sort. |
| pack-priv class | SortBuffer
This class implements an in-memory ordered set based on the balanced binary tree algorithm from Knuth Vol. 3, Sec. 6.2.3, pp. |
| public class | SortBufferRowSource
Wrapping the output of a SortBuffer in a RowSource for the benefit of the createAndLoadConglomerate and loadConglomerate interface. |
| public class | SortBufferScan
A sort scan that just reads rows out of a sorter. |
| public abstract class | SortScan
Abstract base class for merge sort scans. |
| public class | UniqueWithDuplicateNullsExternalSortFactory
Method factory to support sorting of Almost unique index. |
| pack-priv class | UniqueWithDuplicateNullsMergeSort
This class extends and customizes MergeSort to support unique indexes with duplicate nulls. |