| 
 | |||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See: 
          Description
| Class Summary | |
| BinaryTree | A Binary Tree used for sorting. | 
| Compare_en | A Comparer used with lang="en". | 
| Comparer | A Comparer used for comparing keys | 
| CompositeKey | Class representing a single node together with the values of its sort keys | 
| DescendingComparer | A Comparer used for comparing descending keys | 
| DocumentOrderComparer | A Comparer used for comparing nodes in document order | 
| DoubleComparer | A Comparer used for comparing keys that are Doubles | 
| HashMap | A simple class for testing membership of a fixed set of ASCII strings. | 
| LowercaseFirstComparer | A Comparer used for comparing keys | 
| MultiKeyComparer | A MultiKeyComparer compares using a composite sort key. | 
| 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 | 
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.
| 
 | |||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||