|Unicode Collation Algorithm|
The following files provide conformance tests for the Unicode Collation Algorithm (UTS #10: Unicode Collation Algorithm).
These files are large, and thus packaged in zip format to save download time.
There are four different files:
The format is illustrated by the following example:
0385 0021; #GREEK DIALYTIKA TONOS [0209 0237|0047 0032 0020|0002 0002 0002|]
The part before the semicolon is the hex representation of a sequence of Unicode code points. After the hash mark is a comment. This comment is purely informational, and may change in the future. Currently it consists of the name of the first code point, followed by a representation of the sort key for the sequence.
The sort key representation is in square brackets. It uses a vertical bar for the ZERO separator. Between the bars are the primary, secondary, tertiary, and quaternary weights (if any), in hex.
Note: The sort key is purely informational. UCA does not require the production of any particular sort key, as long as the results of comparisons match.
The files are designed so each line in the file will order as being greater than or equal to the previous one, when using the UCA and the Default Unicode Collation Element Table. A test program can read in each line, compare it to the last line, and signal an error if order is not correct. The exact comparison that should be used is as follows:
If there are any errors, then the UCA implementation is not compliant.
- This test is only valid for an untailored DUCET table.
- In step 6, the strings are compared in code point order. Note that in the case of UTF-16, this is not binary order.