W3C home > Mailing lists > Public > public-xslt-40@w3.org > January 2021

Re: improvements to fn:sort functions

From: Liam R. E. Quin <liam@fromoldbooks.org>
Date: Fri, 15 Jan 2021 14:57:37 -0500
Message-ID: <9e79fb424b1fa31642e3b6ef1e348ed7daf4c6a8.camel@fromoldbooks.org>
To: Mukul Gandhi <gandhi.mukul@gmail.com>, public-xslt-40@w3.org
On Fri, 2021-01-15 at 08:24 +0000, Michael Kay wrote:
> The case that can't currently be handled easily is where you have
> multiple sort keys, some ascending and some descending.

The way at least some other programming languages handle that is with a
two-argument comparison function rather than a key-building function.
But i fear it would be very cofunfusing to have a mixture of the two

> But I wonder if it's really needed, since both XSLT and XQuery have
> this level of capability already. We don't have to put everything
> into XPath.

The simple case of ascending/descending on a single sort key seems
worth considering - I agree with Mukhul there. But i'm also ok with
rejecting it. Despite having spent several days, off and on, finding
ways to avoid having Saxon run out of memory when sorting & grouping a
sequence of a million elements :)


Liam Quin, https://www.delightfulcomputing.com/
Available for XML/Document/Information Architecture/XSLT/
XSL/XQuery/Web/Text Processing/A11Y training, work & consulting.
Barefoot Web-slave, antique illustrations:  http://www.fromoldbooks.org
Received on Friday, 15 January 2021 19:58:14 UTC

This archive was generated by hypermail 2.4.0 : Friday, 15 January 2021 19:58:15 UTC