Package org.apache.derby.impl.store.access.sort
package org.apache.derby.impl.store.access.sort
-
ClassesClassDescriptionA sort scan that is capable of merging as many merge runs as will fit in the passed-in sort buffer.Wrapping the output of a MergeScan in a RowSource for the benefit of the createAndLoadConglomerate and loadConglomerate interface.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.This object provides performance information related to a sort.A node in a balanced binary tree.NodeAllocator manages an array of nodes which can be reused.Abstract base class for all sort classes which return rows from the sort.This class implements an in-memory ordered set based on the balanced binary tree algorithm from Knuth Vol. 3, Sec. 6.2.3, pp. 451-471.Wrapping the output of a SortBuffer in a RowSource for the benefit of the createAndLoadConglomerate and loadConglomerate interface.A sort scan that just reads rows out of a sorter.Abstract base class for merge sort scans.Method factory to support sorting of Almost unique index.This class extends and customizes MergeSort to support unique indexes with duplicate nulls.