## Package com.icl.saxon.sort

This package provides utility routines for sorting: specifically, a BinaryTree implementation, a QuickSort implementation, and some Comparer objects that handle character and numeric comparisons.

See:
Description

Interface Summary
NodeOrderComparer: A Comparer used for comparing nodes in document order
Sortable: A Sortable is an object that can be sorted using the QuickSort method.

Class Summary
BinaryTree: A Binary Tree used for sorting.
Compare_en: A Comparer used with lang="en".
Comparer: A Comparer used for comparing keys
DescendingComparer: A Comparer used for comparing descending keys
DoubleComparer: A Comparer used for comparing keys that are Doubles
HashMap: A simple class for testing membership of a fixed set of ASCII strings.
LocalOrderComparer: A Comparer used for comparing nodes in document order.
LowercaseFirstComparer: A Comparer used for comparing keys
QuickSort: This is a generic version of C.A.R Hoare's Quick Sort algorithm.
SortKeyDefinition: A SortKeyDefinition defines one component of a sort key.
StringComparer: A Comparer used for comparing keys.
TextComparer: A Comparer used for comparing text keys
UppercaseFirstComparer: A Comparer used for comparing keys

## Package com.icl.saxon.sort Description

This package provides utility routines for sorting: specifically, a BinaryTree implementation, a QuickSort implementation, and some Comparer objects that handle character and numeric comparisons.

It is possible to extend the sorting capabilities by writing additional Comparers. The class should be named Compare_xx where xx is the language code, as used in the lang parameter of xsl:sort.