Le 01-mars-05, à 11:00, Paul Reeves a écrit :

> On Tuesday 01 March 2005 09:37, Olivier Mascia wrote:
>
>> So a simplified view of what a collation table would be is a simple
>> map
>> of some unicode values to some other binary value. To sort according
>> to
>> the collation, the sort of the characters is done based on their
>> unicode value passed through that map. Any character not considered by
>> the collation is not in the map and sorts according to its original
>> unicode value.
>
> How are descending sorts ordered? I can see one argument that says
> characters outside the collation char set should still get sorted to
> the
> bottom of the list. But on the other hand some users might reasonably
> expect to see a full descending sort.

Do you mean that people would prefer to have a descending sort which is
not an exact inverse of the ascending sort ?
I am not sure I follow you clearly.

--
Olivier Mascia