- From: Martin J Duerst <mduerst@ifi.unizh.ch>
- Date: Wed, 23 Oct 1996 16:31:47 +0100 (MET)
- To: rosenne@NetVision.net.il (Jonathan Rosenne)
- Cc: keld@dkuug.dk, mtbryan@sgml.u-net.com, J.Larmouth@iti.salford.ac.uk, www-international@w3.org
Jonathan Rosenne wrote: >Keld J|rn Simonsen wrote: >> I am not sure why it does not work to follow the international >> standards in this area. I am talking also of SC22/WG20 who is working >> on sorting on the whole of 10646. I gave you a reference earlier. > >As far as I can see the proposed international sorting algorithm for >10646 works just as well with combining characters. Just to clear up the confusion a little bit: - A sorting algorithm/standard of course should consider combining characters, and I assume that the proposed standards do so. - An algorithm that checks for equivalence (in the sense that the user will see various encodings as equivalent in all cases) can use sorting of codepoint as one step. This is elementary binary sorting, and should not be confused with higher-level sorting of characters. Regards, Martin.
Received on Wednesday, 23 October 1996 10:32:42 UTC