RE: arbitrary sorting (part II)

Good one. Basically, what we have found is that a function that can be
enumerated in a finite table is implementable.

But, the question remains whether you can sort on a non-enumerable function
that must be computed. Is it possible?

-----Original Message-----
From: Oliver Becker [mailto:obecker@xxxxxxxxxxxxxxxxxxxxxxx]

Hey, after submitting my mail I got an idea - and - it works!! :-))

For those of you who are interested:

<xsl:stylesheet version="1.0"
                xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                xmlns:m ="urn:non-null-namespace">

<m:month name="Jan" value="1" />
<m:month name="Feb" value="2" />
<m:month name="Mar" value="3" />
.
.
.


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list