![[Unicode]](http://www.unicode.org/webscripts/logo60s2.gif){kind=small}
Unicode
- Collation Algorithm![[Unicode]](https://www.unicode.org/webscripts/logo60s2.gif){kind=small}
+ Unicode Collation Algorithm|
- Unicode
- Collation Algorithm |
+
+
+ Unicode Collation Algorithm |
| @@ -22,9 +22,9 @@ |
The following files provide conformance tests for the Unicode Collation Algorithm - (UTS #10: Unicode Collation Algorithm).
+ (UTS #10: Unicode Collation Algorithm).These files are large, and thus packaged in zip format to save download time.
+++Note: These files test the sort order of an untailored DUCET table. + If you are using an implementation of the + CLDR Collation Algorithm + with its tailored root collation data, + for example ICU or a library that uses ICU for collation, + then you need to test with files that reflect that sort order. + The CLDR collation conformance test files have + the same names (except for an added _CLDR infix) + and structures as the ones here for the DUCET. + You can find them in the CLDR GitHub repo in the folder âcommon/ucaâ, + or in the CLDR data file download area, + in the âcldr-common-*.zipâ file, again in the folder âcommon/ucaâ. + Select the files for the version of CLDR that is used in the implementation.
+
There are four different files:
The format is illustrated by the following example:
@@ -46,25 +62,20 @@ After the hash mark is a comment. This comment is purely informational, and may change in the future. Currently it consists of the characters of the sequence in parentheses, the name of the first code point, and a representation of - the sort key for the sequence. + 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. -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 + 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 @@ -81,9 +92,6 @@
These files contain test cases that include ill-formed strings, with surrogate code points. Implementations that do not weight surrogate code points the same way as reserved code points may filter out such lines lines in the test cases, before testing for conformance.
--Note: This test is only valid for an untailored DUCET table.
-
See âAlso note that the Algorithm employs two distinct contraction matching methods:â at the end of Section 7.2, - Produce Collation Element Arrays.
+ Produce Collation Element Arrays.© 2020 Unicode, Inc. All Rights Reserved. +
© 2022 Unicode, Inc. All Rights Reserved. The Unicode Consortium makes no expressed or implied warranty of any kind, and assumes no liability for errors or omissions. No liability is assumed for incidental and consequential damages in connection with or arising out of the use of the information or programs contained or accompanying this technical report. The Unicode - Terms of Use apply. + Terms of Use apply.
Unicode and the Unicode logo are trademarks of Unicode, Inc., and are registered in some jurisdictions.