W3C home > Mailing lists > Public > public-qt-comments@w3.org > July 2005

[Bug 1753] The sorting process

From: <bugzilla@wiggum.w3.org>
Date: Thu, 28 Jul 2005 21:37:45 +0000
To: public-qt-comments@w3.org
Message-Id: <E1DyG4X-0000FB-2k@wiggum.w3.org>


mike@saxonica.com changed:

           What    |Removed                     |Added
             Status|RESOLVED                    |CLOSED

------- Additional Comments From mike@saxonica.com  2005-07-28 21:37 -------
Change now applied to the editor's draft. The relevant para now reads (changes
marked at="Y"):

<p>In general, comparison of two ordinary values is
 performed according to the rules of the
 XPath <code>lt</code> operator. <phrase diff="add" at="Y">To ensure a total
ordering, the same 
 implementation of the
 <code>lt</code> operator <rfc2119>must</rfc2119> be used for all the
comparisons: the one that is chosen
 is the one appropriate to the most specific type to which all the values can be
converted by subtype substitution
 and/or type promotion. For example, if the sequence contains both
<code>xs:decimal</code> and <code>xs:double</code>
 values, then the values are compared using <code>xs:double</code> comparison,
even when comparing two
 <code>xs:decimal</code> values.</phrase> 
 NaN values, for sorting purposes, are considered to be equal to each other,
 and less than any other numeric value. Special rules
  also apply to the <code>xs:string</code> type
  and types derived by restriction from <code>xs:string</code>,
  as described in the next section.</p>
Received on Thursday, 28 July 2005 21:37:55 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:45:25 UTC