From: Rick McGowan (firstname.lastname@example.org)
Date: Fri May 02 2003 - 13:11:08 EDT
> All permutations of combining marks (all having non-zero combining
> classes) are equivalent to each other.
Whoa! Hang on there! Actually, it is more complicated than that, and
people should READ what the standard has to say about it, and look at the
algorithm for canonical equivalence.
If you're loking at a base X and some string of combinng marks, A, B, C,
etc, then equivalence depends on the CLASSES of A, B, C. Some combinations
are equivalent, and some are different.
See UAX #15, the FAQ on Characters & Combining Marks, and especially the
standard itself, Chapter 3.10. It's online here:
This archive was generated by hypermail 2.1.5 : Fri May 02 2003 - 13:54:27 EDT