| org.apache.derby.impl.store.access.sort |
|
| Java Source File Name | Type | Comment |
| ExternalSortFactory.java | Class | |
| MergeInserter.java | Class | |
| MergeScan.java | Class | A sort scan that is capable of merging as many merge runs
as will fit in the passed-in sort buffer. |
| MergeScanRowSource.java | Class | Wrapping the output of a MergeScan in a RowSource for the benefit of the
createAndLoadConglomerate and loadConglomerate interface. |
| MergeSort.java | Class | 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. |
| MergeSortInfo.java | Class | This object provides performance information related to a sort. |
| Node.java | Class | A node in a balanced binary tree. |
| NodeAllocator.java | Class | NodeAllocator manages an array of nodes which can be reused. |
| Scan.java | Class | Abstract base class for all sort classes which return rows from the
sort. |
| SortBuffer.java | Class | This class implements an in-memory ordered set
based on the balanced binary tree algorithm from
Knuth Vol. |
| SortBufferRowSource.java | Class | Wrapping the output of a SortBuffer in a RowSource for the benefit of the
createAndLoadConglomerate and loadConglomerate interface.
Scan implements ScanController, this class just implements the
RowSource interface. |
| SortBufferScan.java | Class | A sort scan that just reads rows out of a sorter. |
| SortScan.java | Class | Abstract base class for merge sort scans. |